T. Achterberg, T. Koch, and A. Martin, Branching rules revisited, Operations Research Letters, vol.33, pp.42-54, 2005.

D. Applegate, R. Bixby, V. Chvátal, and W. Cook, Finding cuts in TSP, 1995.

C. Barnhart, J. E. Nemhauser, G. Savelsbergh, M. Vance, and P. , Branch-and-price: column generation for solving huge integer programs, Operations Research, vol.46, pp.316-329, 1998.

E. Beale and J. Tomlin, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, Proceedings of the Fifth International Conference on Operational Research, 1970.

M. Benichou, J. Gauthier, P. Girodet, G. Hentges, G. Ribiere et al., Experiments in mixed-integer programming, Mathematical Programming, vol.1, pp.71-94, 1971.

N. Boland, P. Domínguez-marín, S. Nickel, and J. Puerto, Exact procedures for solving the discrete ordered median problem, Computers & Operations Research, vol.33, issue.11, pp.3270-3300, 2006.

A. Ceselli, M. Gatto, M. E. Lübbecke, M. Nunkesser, and H. Schilling, Optimizing the Cargo Express Service of Swiss Federal Railways, Transportation Science, vol.42, issue.4, pp.450-465, 2008.

V. Chvátal, Linear Programming, 1983.

S. Deleplanque, M. Labbé, D. Ponce, and J. Puerto, An extended version of a Branch-Priceand-Cut Procedure for the Discrete Ordered Median Problem, pp.2158317-2158318, 2018.

J. Desrosiers and M. Lübbecke, A primer in column generation, Column Generation, 2005.

S. Doulabi, L. M. Rousseau, and G. Pesant, A constraint-programming-based branch-andprice-and-cut approach for operating room planning and scheduling, INFORMS Journal on Computing, vol.28, issue.3, pp.432-448, 2016.

O. Du-merle, D. Villenueve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Mathematics, vol.194, pp.229-237, 1999.

G. Farkas, 1894) A Fourier-féle mechanikai elv alkalmazásai, Mathematikaí es Természettudományí Erstesitö, issue.12, pp.457-472

T. A. Feo and M. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, vol.8, pp.67-71, 1989.

T. A. Feo and M. Resende, Greedy ramdomized adaptive search procedures, Journal of Global Optimization, vol.6, pp.109-133, 1995.

E. Fernández, J. Puerto, and A. M. Rodríguez-chía, On Discrete Optimization with Ordering, Annals of Operations Research, vol.207, issue.1, pp.83-96, 2013.

E. Fernández, M. A. Pozo, and J. Puerto, Ordered Weighted Average Combinatorial Optimization: Formulations and their properties, Discrete Applied Mathematics, vol.169, issue.31, pp.97-118, 2014.

E. Fernández, M. A. Pozo, J. Puerto, and A. Scozzari, Ordered Weighted Average Optimization in Multiobjective Spanning Tree Problems, European Journal of Operational Research, vol.260, issue.31, pp.886-903, 2017.

G. Gamrath, Generic Branch-Cut-and-Price, 2010.

G. Gamrath, T. Fischer, T. Gally, A. M. Gleixner, G. Hendel et al., The SCIP optimization suite 3.2, 2016.

O. Günlük, L. Ladányi, and S. De-vries, A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions, Management Science, vol.51, issue.3, pp.391-406, 2005.

E. L. Johnson, Modeling and Strong Linear Programs for Mixed Integer Programming, Algorithms and Model Formulations in Mathematical Programming, pp.978-981, 1989.

M. Labbé, D. Ponce, and J. Puerto, A comparative study of formulations and solution methods for the discrete ordered p-median problem, Computers & Operations Research, vol.78, pp.230-242, 2017.

A. Marín, S. Nickel, J. Puerto, and S. Velten, A flexible model and efficient solution strategies for discrete location problems, Discrete Applied Mathematics, vol.157, issue.5, pp.1128-1145, 2009.

A. Marín, S. Nickel, and S. Velten, An extended covering model for flexible discrete and equity location problems, Mathematical Methods of Operations Research, vol.71, issue.1, pp.125-163, 2010.

S. Nickel, Discrete ordered weber problems, Operations Research Proceedings, pp.71-76, 2000.

S. Nickel and J. Puerto, A unified approach to network location problems, Networks, vol.34, pp.283-290, 1999.

S. Nickel and J. Puerto, Location Theory: A Unified Approach, 2005.

F. Perea and J. Puerto, Finding the nucleolus of any n?person cooperative game by a single linear program, Computers & Operations Research, vol.40, issue.10, pp.2308-2313, 2013.

A. Pessoa, E. Uchoa, M. P. Aragão, and R. Rodrigues, Exact Algorithm over an ArctimeIndexed Formulation for Parallel Machine Scheduling Problems, Mathematical Programming Computation, vol.2, pp.259-290, 2010.

D. Ponce, J. Puerto, F. Ricca, and A. Scozzari, Mathematical programming formulations for the efficient solution of the k-sum approval voting problem, Computers & Operations Research, vol.98, pp.127-136, 2018.

J. Puerto, A new formulation of the capacitated discrete ordered median problem with {0, 1}-assignment, Operations Research Proceedings, pp.165-170, 2007.

J. Puerto and F. Fernández, Geometrical properties of the symmetrical single facility location problem, Journal of Nonlinear and Convex Analysis, vol.1, issue.3, pp.321-342, 2000.

J. Puerto, D. Pérez-brito, and C. G. García-gonzález, A modified variable neighborhood search for the discrete ordered median problem, European Journal of Operational Research, vol.234, pp.61-76, 2014.

J. Puerto, A. M. Rodríguez-chía, and A. Tamir, Minimax regret single-facility ordered median location problems on networks, INFORMS Journal on Computing, vol.21, issue.1, pp.77-87, 2009.

J. Puerto, A. B. Ramos, and A. M. Rodríguez-chía, Single-allocation ordered median hub location problems, Computers & Operations Research, vol.38, issue.2, pp.559-570, 2011.

J. Puerto, A. B. Ramos, and A. M. Rodríguez-chía, A specialized Branch & Bound & Cut for Single-Allocation Ordered Median Hub Location problems, Discrete Applied Mathematics, vol.161, pp.2624-2646, 2013.

J. Puerto, A. B. Ramos, A. M. Rodríguez-chía, and S. Mc, Ordered Median Hub Location Problems with Capacity Constraints, Transportation Research Part C: Emerging Technologies, vol.70, pp.142-156, 2016.

J. Puerto and . Rodríguez-chía, AM Ordered Median Location Problems, Location Science, 2015.

D. M. Ryan and A. Foster, An integer programming approach to scheduling. Wren A, Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, pp.269-280, 1981.

L. A. Wolsey, Integer programming, 1998.