C. References, N. Artigues, B. M. Jozefowiez, and . Sarpong, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, EURO Journal on Computational Optimization, pp.1-26, 2018.

R. Baldacci, M. A. Boschetti, V. Maniezzo, and M. Zamboni, Scatter search methods for the covering tour problem, Metaheuristic optimization via memory and evolution, pp.59-91, 2005.

R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, issue.2, pp.351-385, 2008.

R. Baldacci, A. Mingozzi, and R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.

J. E. Beasley, Route firstcluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-408, 1983.

G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol.12, issue.4, pp.568-581, 1964.

J. R. Current and D. A. Schilling, The median tour and maximal covering tour problems: Formulations and heuristics, European Journal of Operational Research, vol.23, issue.3, pp.114-126, 1989.

M. Dror, Note on the complexity of the shortest path models for column generation in vrptw, Operations Research, vol.42, issue.5, pp.977-978, 1994.

D. Du-merle, J. Villeneuve, P. Desrosiers, and . Hansen, Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999.

D. A. Flores-garza, M. A. Salazar-aguilar, S. U. Ngueveu, and G. Laporte, The multi-vehicle cumulative covering tour problem, Annals of Operations Research, vol.258, issue.2, pp.761-780, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01880113

M. Gendreau, G. Laporte, F. E. Semet-;-b, L. R. Gillett, and . Miller, A heuristic algorithm for the vehicle-dispatch problem, Operations Research, vol.45, issue.4, pp.340-349, 1974.

M. T. Godinho, L. Gouveia, and T. L. Magnanti, Combined route capacity and route length models for unit demand vehicle routing problems, Discrete Optimization, vol.5, issue.2, pp.350-372, 2008.

M. H. Ha, N. Bostel, A. Langevin, and L. Rousseau, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices, European Journal of Operational Research, vol.226, issue.2, pp.211-220, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00816026

M. Hachicha, M. J. Hodgson, G. Laporte, and F. Semet, Heuristics for the multi-vehicle covering tour problem, Computers & Operations Research, vol.27, issue.1, pp.29-42, 2000.

Y. Haimes, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE transactions on systems, man, and cybernetics, vol.1, issue.3, pp.296-297, 1971.

M. J. Hodgson, G. Laporte, and F. Semet, A covering tour model for planning mobile health care facilities in suhumdistrict, ghama, Journal of Regional Science, vol.38, issue.4, pp.621-638, 1998.

N. Jozefowiez, ;. Jozefowiez, F. Semet, and E. Talbi, A branch-and-price algorithm for the multivehicle covering tour problem, Computers & Operations Research, vol.64, issue.3, pp.1929-1942, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01913508

M. Kammoun, H. Derbel, M. Ratli, and B. Jarboui, An integration of mixed vnd and vns: the case of the multivehicle covering tour problem, International Transactions in Operational Research, vol.24, issue.3, pp.663-679, 2017.

M. Labbé and G. Laporte, Maximizing user convenience and postal service efficiency in post box location, Belgian Journal of Operations Research, vol.26, pp.21-35, 1986.

V. A. Lopes, A. S. Souza, and . Da-cunha, A branch-and-price algorithm for the multi-vehicle covering tour problem, Electronic Notes in Discrete Mathematics, vol.44, pp.61-66, 2013.

K. Murakami, A column generation approach for the multi-vehicle covering tour problem, 2014 IEEE International Conference on Automation Science and Engineering (CASE), pp.1063-1068, 2014.

K. Murakami, Iterative column generation algorithm for generalized multi-vehicle covering tour problem, Asia-Pacific Journal of Operational Research, vol.35, issue.04, p.1850021, 2018.

Z. Naji-azimi, J. Renaud, A. Ruiz, and M. Salari, A covering tour approach to the location of satellite distribution centers to supply humanitarian aid, European Journal of Operational Research, vol.222, issue.3, pp.596-605, 2012.

C. Nolz, K. F. Doerner, W. J. Gutjahr, and R. F. Hartl, A bi-objective metaheuristic for disaster relief operation planning, Advances in multi-objective nature inspired computing, pp.167-187, 2010.

A. D. Oliveira, A. C. Moretti, and E. F. Reis, Multi-vehicle covering tour problem: building routes for urban patrolling, Pesquisa Operacional, vol.35, issue.3, pp.617-644, 2015.

A. Pham, M. H. Hà, and X. H. Nguyen, Solving the multi-vehicle multi-covering tour problem, Computers & Operations Research, vol.88, pp.258-278, 2017.

A. Pigatti, M. P. De-aragao, and E. Uchoa, Stabilized branch-and-cut-and-price for the generalized assignment problem, Electronic Notes in Discrete Mathematics, vol.19, pp.389-395, 2005.

M. Sarpong, C. Artigues, and N. Jozefowiez, Column generation for bi-objective vehicle routing problems with a minmax objective, ATMOS-13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems-2013, vol.33, pp.137-149, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00871741

P. Toth and A. Tramontani, An integer linear programming local search for capacitated vehicle routing problems, The vehicle routing problem: Latest advances and new challenges, pp.275-295, 2008.

A. Tricoire, W. J. Graf, and . Gutjahr, The bi-objective stochastic covering tour problem, Computers & Operations Research, vol.39, issue.7, pp.1582-1592, 2012.