A Note on Garfinkel, Neebe and Rao's LP Decomposition for the p -Median Problem

Roberto Diéguez Galvão
Additional contact information
Roberto Diéguez Galvão: COPPE-Universidade Federal do Rio de Janeiro, Rio de Janeiro

Transportation Science, 1981, vol. 15, issue 3, 175-182

Abstract: The convergence problems of Garfinkel, Neebe and Rao's linear programming decomposition algorithm for the relaxed p -median problem are analyzed and traced back to the very degenerate nature of the LP formulation. Extensive computational experience with this algorithm is described. One surprising outcome of the tests conducted with the decomposition algorithm was that convergence was obtained more consistently when a random (and usually worse) initial solution was used instead of a “good” initial solution provided by heuristic methods.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.15.3.175 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:15:y:1981:i:3:p:175-182

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().