A comparison of heuristics and relaxations for the capacitated plant location problem

[1]  K. Jörnsten,et al.  Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem , 1991 .

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[3]  Laurence A. Wolsey,et al.  Lot-size models with backlogging: Strong reformulations and cutting planes , 1988, Math. Program..

[4]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[5]  M. Guignard,et al.  Lagrangean decomposition for integer programming: theory and applications , 1987 .

[6]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[7]  Wolfgang Domschke,et al.  ADD – heuristics' starting procedures for capacitated plant location models , 1985 .

[8]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.

[9]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[10]  Leon F. McGinnis,et al.  Invited reviewLocational analysis , 1983 .

[11]  Søren Kruse Jacobsen,et al.  Heuristics for the capacitated plant location model , 1983 .

[12]  Nicos Christofides,et al.  Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

[13]  Barrie M. Baker,et al.  Linear Relaxations of the Capacitated Warehouse Location Problem , 1982 .

[14]  C. J. McCallum,et al.  Facility location models for planning a transatlantic communications network , 1981 .

[15]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[16]  Monique Guignard-Spielberg,et al.  A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..

[17]  Robert M. Nauss,et al.  An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .

[18]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[19]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[22]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[23]  B. M. Khumawala.  An efficient heuristic procedure for the uncapacitated warehouse location problem , 1973 .

[24]  G. Thompson,et al.  An operator theory of parametric programming for the transportation problem‐II , 1972 .

[25]  Graciano Sá,et al.  Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..

[26]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[27]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[28]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .