A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
From MaRDI portal
Publication:3978742
DOI10.1057/jors.1991.117zbMath0736.90050OpenAlexW1999269508MaRDI QIDQ3978742
No author found.
Publication date: 25 June 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1991.117
Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A maximal covering location model in the presence of partial coverage, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, A dual RAMP algorithm for single source capacitated facility location problems, Modeling and solving a logging camp location problem, A Lagrangean heuristic for the facility location problem with staircase costs
