Abstract
Preprocessing plays a crucial role in solving combinatorial optimization problems. Itcan be realized through reduction tests which allow one to determine in advance the valuesthat a set of variables will take in the optimal solution, thus reducing the size of an instance.Reduction tests can be summarily classified in two main families: those based on reducedcosts and those based on logical implications. The first rely on reduced costs of the LinearProgramming problem associated to continuous relaxation. The second are based on thespecial features of the problem and on combinatorial techniques. In this paper, some effectivereduction tests for the p‐median problem are proposed, showing their impact on the size ofthe instances and on model formulation. Finally, some work perspectives to embed reductiontests into solution algorithms for the p‐median problem are pointed out.
Similar content being viewed by others
References
P. Avella and A. Sassano, The p-median polytope: Facets and separation algorithms, Technical Report 22/94 DIS, Università di Roma “La Sapienza”.
J.E. Beasley, A note on solving large scale p-median problems, EJOR 21(1985)270-273.
J.E. Beasley, Lagrangian relaxation, Technical Report, Imperial College, London, 1992.
N. Christofides and J.E. Beasley, A tree search algorithm for the p-median problem, EJOR 10(1982) 196-204.
O. Kariv and L. Hakimi, An algorithmic approach to network location problems, II: The p-medians, SIAM J. Appl. Math. 37(1979)539-560.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, 1988.
A. Sassano, private communication.
M.B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Oper. Res. 16(1968)955-961.
Rights and permissions
About this article
Cite this article
Avella, P., Sforza, A. Logical reduction tests for the p‐problem. Annals of Operations Research 86, 105–115 (1999). https://doi.org/10.1023/A:1018990331754
Issue Date:
DOI: https://doi.org/10.1023/A:1018990331754