Lagrangean heuristics for location problems

[1]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[2]  Adriano O. De Maio,et al.  An all Zero-One Algorithm for a Certain Class of Transportation Problems , 1971, Oper. Res..

[3]  V. Srinivasan,et al.  An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems , 1973, Oper. Res..

[4]  G. Ross,et al.  Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[5]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[6]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[7]  Samuel Eilon,et al.  Note---Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem , 1978 .

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

[9]  Søren Kruse Jacobsen,et al.  On the use of tree-indexing methods in transportation algorithms , 1978 .

[10]  Jeff Branman.  A note on pivoting in transportation codes , 1978 .

[11]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[12]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

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

[14]  Nicos Christofides,et al.  A tree search algorithm for the p-median problem , 1982 .

[15]  M. R. Rao,et al.  An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .

[16]  R. L. Francis,et al.  State of the Art-Location on Networks: A Survey. Part II: Exploiting Tree Network Structure , 1983 .

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

[18]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[19]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

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

[21]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

[22]  T. B. Boffey,et al.  p-Medians and Multi-Medians , 1984 .

[23]  J. Barceló,et al.  A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .

[24]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[25]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[26]  J. Karkazis.  Principal direction search: A new method of search for unconstrained LP formulations , 1985 .

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

[28]  J. Beasley.  A note on solving large p-median problems , 1985 .

[29]  A. Drexl,et al.  Location and Layout Planning: An International Bibliography , 1985 .

[30]  P. Dearing.  Review of recent developments: Location problems , 1985 .

[31]  C. H. Aikens,et al.  Facility location models for distribution planning , 1985 .

[32]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

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

[34]  Hanan Luss,et al.  A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .

[35]  K. Jörnsten,et al.  A new Lagrangian relaxation approach to the generalized assignment problem , 1986 .

[36]  Barrie M. Baker.  A partial dual algorithm for the capacitated warehouse location problem , 1986 .

[37]  Ramaswami Sridharan,et al.  A heuristic Lagrangean algorithm for the capacitated plant location problem — A comment , 1986 .

[38]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[39]  J. Beasley.  An algorithm for set covering problem , 1987 .

[40]  J. Beasley.  An algorithm for solving large capacitated warehouse location problems , 1988 .

[41]  Alexander H. G. Rinnooy Kan,et al.  The Design, Analysis and Implementation of Heuristics , 1988 .

[42]  D. Tcha,et al.  A Dual-Based Add Heuristic for Uncapacitated Facility Location , 1988 .

[43]  Alan M. Frieze,et al.  Probabilistic Analysis of a Relaxation for the k-Median Problem , 1986, Math. Oper. Res..

[44]  M. Guignard.  A Lagrangean dual ascent algorithm for simple plant location problems , 1988 .

[45]  K. Darby-Dowman,et al.  Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem , 1988 .

[46]  Manfred Körkel.  On the exact solution of large-scale simple plant location problems , 1989 .

[47]  Monique Guignard-Spielberg,et al.  Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem , 1989, Oper. Res..

[48]  R. D. Galvão,et al.  A method for solving to optimality uncapacitated location problems , 1990 .

[49]  H. Simão,et al.  A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem , 1989 .

[50]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[51]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[52]  G. Cornuéjols,et al.  A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[53]  M. E. Captivo.  Fast primal and dual heuristics for the p-median location problem , 1991 .