Logical reduction tests for the p-median problem

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 105-115

  Avella, Pasquale ^a   Sforza, Antonio ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033464965     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018990331754     Document Type: Article

References (8)

1. P. Avella and A. Sassano, The p-median polytope: Facets and separation algorithms, Technical Report 22/94 DIS, Università di Roma "La Sapienza".
2. J.E. Beasley, A note on solving large scale p-median problems, EJOR 21(1985)270-273.
3. J.E. Beasley, Lagrangian relaxation, Technical Report, Imperial College, London, 1992.
4. N. Christofides and J.E. Beasley, A tree search algorithm for the p-median problem, EJOR 10(1982) 196-204.
5. O. Kariv and L. Hakimi, An algorithmic approach to network location problems, II: The p-medians, SIAM J. Appl. Math. 37(1979)539-560.
6. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, 1988.
7. A. Sassano, private communication.
8. M.B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Oper. Res. 16(1968)955-961.