A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment

DOI10.1016/0377-2217(86)90246-8zbMATH Open0577.90019OpenAlexW2064707758MaRDI QIDQ1065703FDOQ1065703

Authors: B. George 

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

Recommendations

• A heuristic lagrangean algorithm for the capacitated plant location problem
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints

zbMATH Keywords

capacitated plant locationheuristic Lagrangean relaxation algorithm

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• A heuristic lagrangean algorithm for the capacitated plant location problem

Cited In (11)

• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
• Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
• Lagrangean heuristics for location problems
• Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• A repeated matching heuristic for the single-source capacitated facility location problem
• A simulated annealing methodology to distribution network design and management
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

This page was built for publication: A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065703)