S. W. Hess, J. B. Weaver, H. J. Siegfeldt, J. N. Whelan, and P. A. Zitlau, Nonpartisan political redistricting by computer, vol.13, pp.998-1006, 1965.
DOI : 10.1287/opre.13.6.998

A. Mehrotra, E. L. Johnson, and G. L. Nemhauser, An optimization based heuristic for political districting, Management Science, vol.44, issue.8, pp.1100-1114, 1998.
DOI : 10.1287/mnsc.44.8.1100

A. A. Zoltners and P. Sinha, Sales territory alignment: A review and model, Management Science, vol.29, issue.11, pp.1237-1256, 1983.
DOI : 10.1287/mnsc.29.11.1237

R. Z. Ríos-mercado and E. Fernández, A reactive grasp for a commercial territory design problem with multiple balancing requirements, Computers & Operations Research, vol.36, issue.3, pp.755-776, 2009.

M. G. Elizondo-amaya, R. Z. Ríos-mercado, and J. A. Díaz, A dual bounding scheme for a territory design problem, Computers & Operations Research, vol.44, pp.193-205, 2014.
DOI : 10.1016/j.cor.2013.11.006

S. Hanafi, A. Freville, and P. Vaca, Municipal solid waste collection: An effective data structure for solving the sectorization problem with local search methods, INFOR: Information Systems and Operational Research, vol.37, pp.236-254, 1999.

L. Muyldermans, D. Cattrysse, and D. Van-oudheusden, District design for arc-routing applications, Journal of the Operational Research Society, vol.54, issue.11, pp.1209-1221, 2003.
DOI : 10.1057/palgrave.jors.2601626

J. Kalcsics, Districting problems, Location Science, pp.595-622, 2015.
DOI : 10.1007/978-3-319-13111-5_23

L. Silva-de-assis, P. M. França, and F. L. Usberti, A redistricting problem applied to meter reading in power distribution networks, Computers & Operations Research, vol.41, pp.65-75, 2014.

G. Cho and D. X. Shaw, The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem, Networks, vol.31, pp.205-216, 1998.

G. Cho and D. X. Shaw, A depth-first dynamic programming algorithm for the tree knapsack problem, INFORMS Journal on Computing, vol.9, pp.431-438, 1997.
DOI : 10.1287/ijoc.9.4.431

S. Elloumi, M. Labbé, and Y. Pochet, A new formulation and resolution method for the p-center problem, INFORMS Journal on Computing, vol.16, issue.1, pp.84-94, 2004.

A. Ceselli and G. Righini, An optimization algorithm for a penalized knapsack problem, Operations Research Letters, vol.34, issue.4, pp.394-404, 2006.
DOI : 10.1016/j.orl.2005.06.001

F. Clautiaux, J. Guillot, Y. Magnouche, P. Pesneau, D. Trut et al., Clustering problem for waste collection, INRIA Research team ReAlOpt, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01418346

D. S. Johnson and K. A. Niemi, On knapsacks, partitions, and a new dynamic programming technique for trees, Mathematics of Operations Research, vol.8, issue.1, pp.1-14, 1983.
DOI : 10.1287/moor.8.1.1
URL : https://minds.wisconsin.edu/bitstream/1793/58238/1/TR399.pdf

F. Della-croce, U. Pferschy, and R. Scatamacchia, New exact approaches and approximation results for the penalized knapsack problem

T. Ibaraki and Y. Nakamura, A dynamic programming method for single machine scheduling, European Journal of Operational Research, vol.76, pp.90007-90015, 1994.
DOI : 10.1016/0377-2217(94)90007-8

P. Wentges, Weighted dantzig-wolfe decomposition for linear mixed-integer programming, International Transactions in Operational Research, vol.4, issue.2, pp.151-162, 1997.
DOI : 10.1016/s0969-6016(97)00001-4

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and combination of linear-programming based stabilization techniques in column generation, INFORMS Journal on Com
URL : https://hal.archives-ouvertes.fr/hal-01077984

, Ibm ilog cplex optimization studio cplex

F. Vanderbeck, Bapcod-a branch-and-price generic code