R. M. Karp, Reducibility among combinatorial problems, Symposium on the Complexity of Computer Computations, pp.85-103, 1972.

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC, pp.38-49, 1973.

V. Chvatal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, vol.4, issue.3, pp.233-235, 1979.

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM, vol.41, issue.5, pp.960-981, 1994.

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 29th Annual ACM Symposium on Theory of Computing, STOC, pp.475-484, 1997.

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

A. Srinivasan, Improved approximations of packing and covering problems, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC, pp.268-276, 1995.

T. Koch, Mathematical Programming Computation, vol.3, issue.2, p.103, 2010.

G. Pataki, M. Tural, and E. B. Wong, Basis reduction and the complexity of branchand-bound, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.1254-1261, 2010.

J. Li and Y. Jin, A ptas for the weighted unit disk cover problem, Automata, Languages, and Programming: 42nd International Colloquium, ICALP, pp.898-909

H. Springer-berlin, , 2015.

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, vol.47, pp.112-124, 2014.

A. Schöbel, Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network, 2006.

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, 17th International Radar Symposium, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01559432

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.

, National Research Council: Evaluation of the Multifunction Phased Array Radar Planning Process, 2008.

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

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

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.

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.

V. V. Vazirani, Approximation Algorithms, 2001.

D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, 1st edn, 2011.

G. Ausiello, M. Protasi, A. Marchetti-spaccamela, G. Gambosi, P. Crescenzi et al., Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1st edn, 1999.