A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
From MaRDI portal
Publication:1065703
DOI10.1016/0377-2217(86)90246-8zbMath0577.90019OpenAlexW2064707758MaRDI QIDQ1065703
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90246-8
Related Items
A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach, Lagrangean heuristics for location problems, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, A simulated annealing methodology to distribution network design and management, A repeated matching heuristic for the single-source capacitated facility location problem
Cites Work
