M. Skolnik, Radar Handbook, Third Edition, 2008.

W. Stutzman and G. Thiele, Antenna Theory and Design, 2012.

S. J. Orfanidis, Electromagnetic Waves and Antennas. Rutgers University, 2016.

W. H. Von and . Aulock, Properties of Phased Arrays, Proceedings of the IRE, vol.48, issue.10, pp.1715-1727, 1960.

R. Brent, Algorithms for Minimization Without Derivatives, 1973.

B. R. Mahafza, Radar Signal Analysis and Processing Using MATLAB, 2008.
DOI : 10.1201/9781420066449

H. Meikle, Modern Radar Systems, ser. Artech House radar library, 2001.

P. Swerling, Probability of detection for fluctuating targets, IEEE Transactions on Information Theory, vol.6, issue.2, pp.269-308, 1960.
DOI : 10.1109/TIT.1960.1057561

D. P. Meyer and H. A. Mayer, Radar target detection, handbook of theory and practice, 1973.

V. V. Vazirani, Approximation Algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

R. M. Karp-]-d and . Johnson, Reducibility among combinatorial problems Available: https: //doi.org/10 Approximation algorithms for combinatorial problems, Symposium on the Complexity of Computer Computations Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pp.85-103, 1007.

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, vol.41, issue.5, pp.960-981, 1994.
DOI : 10.1145/185675.306789

R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.475-484, 1997.
DOI : 10.1145/258533.258641

B. Escoffier and V. T. Paschos, Completeness in approximation classes beyond APX, Theoretical Computer Science, vol.359, issue.1-3, pp.369-377, 2006.
DOI : 10.1016/j.tcs.2006.05.023
URL : https://hal.archives-ouvertes.fr/hal-00958036

A. Srinivasan, Improved approximations of packing and covering problems, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.268-276, 1995.
DOI : 10.1145/225058.225138

T. Koch, Available: https: //doi, Mathematical Programming Computation, vol.3, issue.103, 2010.

J. Beasley, An algorithm for set covering problem, European Journal of Operational Research, vol.31, issue.1, pp.85-93, 1987.
DOI : 10.1016/0377-2217(87)90141-X

B. Yelbay, ?. ?. Birbil, and K. Bülbül, The set covering problem revisited: An empirical study of the value of dual information, Journal of Industrial and Management Optimization, vol.11, issue.2, pp.575-594, 2015.
DOI : 10.3934/jimo.2015.11.575

J. Beasley and P. Chu, A genetic algorithm for the set covering problem, European Journal of Operational Research, vol.94, issue.2, pp.392-404, 1996.
DOI : 10.1016/0377-2217(95)00159-X

D. Krupa, R. , A. Basu-roy, M. De, and S. Govindarajan, Demand hitting and covering of intervals Available: https://doi.org/10, Algorithms and Discrete Applied Mathematics: 3rd International Conference, CALDAM, pp.267-280978, 1007.

J. Li and Y. Jin, A ptas for the weighted unit disk cover problem Available: https://doi.org/10, Automata, Languages, and Programming: 42nd International Colloquium, pp.898-909978, 1007.

T. M. Chan and E. Grant, Exact algorithms and APX-hardness results for geometric packing and covering problems, special Issue: 23rd Canadian Conference on Computational Geometry (CCCG11). [Online]. Available, pp.112-124, 2014.
DOI : 10.1016/j.comgeo.2012.04.001

G. Ausiello, M. Protasi, A. Marchetti-spaccamela, G. Gambosi, P. Crescenzi et al., Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1999.
DOI : 10.1007/978-3-642-58412-1

J. Matouek and B. Gärtner, Understanding and Using Linear Programming (Universitext), 2006.

N. Megiddo, On Finding Primal- and Dual-Optimal Bases, ORSA Journal on Computing, vol.3, issue.1, pp.63-65, 1991.
DOI : 10.1287/ijoc.3.1.63
URL : http://theory.stanford.edu/%7Emegiddo/pdf/primdual.pdf

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372

Y. Briheche, F. Barbaresco, F. Bennis, D. Chablat, and F. Gosselin, Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming The Design of Approximation Algorithms, 2016 17th International Radar Symposium (IRS), 2011.

F. Barbaresco, J. Deltour, G. Desodt, B. Durand, T. Guenais et al., Intelligent m3r radar time resources management: Advanced cognition, agility & autonomy capabilities, Radar Conference -Surveillance for a Safer World, RADAR. International, 2009.
DOI : 10.1109/radar.2008.4721158

M. I. Jimenez, L. D. Val, J. J. Villacorta, A. Izquierdo, and M. R. Mateos, Design of task scheduling process for a multifunction radar, IET Radar Sonar & Navigation, vol.6, issue.5, pp.341-347, 2012.
DOI : 10.1049/iet-rsn.2011.0309

S. L. Miranda, C. J. Baker, K. Woodbridge, and H. D. Griffiths, Comparison of scheduling algorithms for multifunction radar, IET Radar, Sonar & Navigation, vol.1, issue.6, pp.414-424, 2007.
DOI : 10.1049/iet-rsn:20070003

P. W. Moo, Scheduling for multifunction radar via two-slope benefit functions, IET Radar, Sonar & Navigation, vol.5, issue.8, pp.884-894, 2011.
DOI : 10.1049/iet-rsn.2010.0237

P. M. Hahn and S. D. Gross, Beam Shape Loss and Surveillance Optimization for Pencil Beam Arrays, IEEE Transactions on Aerospace and Electronic Systems, vol.5, issue.4, pp.674-675, 1969.
DOI : 10.1109/TAES.1969.309952

D. Jang, H. Choi, and J. Roh, Search optimization for minimum load under detection performance constraints in multi-function phased array radars, Aerospace Science and Technology, vol.40, pp.86-95, 2015.
DOI : 10.1016/j.ast.2014.10.005

S. Torres, R. Adams, C. Curtis, E. Forren, D. Forsyth et al., A demonstration of adaptive weather surveillance and multifunction capabilities on the National Weather Radar Testbed Phased Array Radar, 2014 International Radar Conference, 2014.
DOI : 10.1109/RADAR.2014.7060420

P. Berman, J. Jeong, S. P. Kasiviswanathan, and B. Urgaonkar, Packing to angles and sectors, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, pp.171-180, 2007.
DOI : 10.1145/1248377.1248405

F. Y. Chin, H. Ting, and Y. Zhang, Variable-Size Rectangle Covering, Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, pp.145-154, 2009.
DOI : 10.1007/978-3-540-73545-8_38
URL : http://www.cs.hku.hk/~chin/paper/COCOA09%20variable%20covering.pdf

B. D. Carlson and D. Willner, Antenna pattern synthesis using weighted least squares, IEE Proceedings H (Microwaves, Antennas and Propagation ), pp.11-16, 1992.
DOI : 10.1049/ip-h-2.1992.0003

G. K. Mahanti, A. Chakraborty, and S. Das, PHASE-ONLY AND AMPLITUDE-PHASE ONLY SYNTHESIS OF DUAL-BEAM PATTERN LINEAR ANTENNA ARRAYS USING FLOATING-POINT GENETIC ALGORITHMS, Progress In Electromagnetics Research, vol.68, pp.247-259, 2007.
DOI : 10.2528/PIER06072301

Y. Han and C. Wan, Scalable Alternating Projection and Proximal Splitting for Array Pattern Synthesis, International Journal of Antennas and Propagation, vol.137, issue.6, 2015.
DOI : 10.1007/s11228-013-0239-2

S. Umetani and M. Yagiura, RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan), Journal of the Operations Research Society of Japan, vol.50, issue.4, pp.350-375, 2007.
DOI : 10.15807/jorsj.50.350

A. Caprara and M. Fischetti, A Heuristic Method for the Set Covering Problem, Operations Research, vol.47, issue.5, pp.730-743, 1999.
DOI : 10.1287/opre.47.5.730

A. Caprara, P. Toth, and M. Fischetti, Algorithms for the set covering problem Available: https://doi.org/10, Annals of Operations Research, vol.98, issue.1/4, pp.353-371, 1023.
DOI : 10.1023/A:1019225027893

E. Danna, M. Fenelon, Z. Gu, and R. Wunderling, Generating Multiple Solutions for Mixed Integer Programming Problems, pp.280-294978, 2007.
DOI : 10.1007/978-3-540-72792-7_22

E. Danna and D. L. Woodruff, How to select a small set of diverse solutions to mixed integer programming problems, S0167637709000431 [51] S. Mecke and D. Wagner, Solving Geometric Covering Problems by Data Reduction, pp.255-260, 2004.
DOI : 10.1016/j.orl.2009.03.004

P. Greistorfer, A. Løkketangen, S. Voß, and D. L. Woodruff, Experiments concerning sequential versus simultaneous maximization of objective function and distance, Journal of Heuristics, vol.84, issue.6, pp.613-625, 2008.
DOI : 10.1007/978-1-4757-3023-4_2

J. Tsai, M. Lin, and Y. Hu, Finding multiple solutions to general integer linear programs, European Journal of Operational Research, vol.184, issue.2, pp.802-809, 2008.
DOI : 10.1016/j.ejor.2006.11.024