The capacitated plant location problem
From MaRDI portal
Publication:1390274
DOI10.1016/0377-2217(95)00042-OzbMath0914.90180MaRDI QIDQ1390274
Publication date: 14 July 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Lagrangian relaxation; branch-and-bound; Lagrangian heuristic; variable splitting; capacitated plant location
90B80: Discrete location and assignment
Related Items
Polyhedral results for the precedence-constrained knapsack problem, Location and layout planning. A survey, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Lagrangean heuristics for location problems, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Research challenges in environmental management, A cross decomposition algorithm for a multiproduct-multitype facility location problem
Cites Work
- Unnamed Item
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- A cost operator approach to multistage location-allocation
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A direct dual method for the mixed plant location problem with some side constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Location-Allocation Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Linear Relaxations of the Capacitated Warehouse Location Problem
- A Dual-Based Procedure for Dynamic Facility Location
- An efficient heuristic procedure for the capacitated warehouse location problem
- Multicommodity Distribution System Design by Benders Decomposition
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Improved Algorithm for the Capacitated Facility Location Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- A branch‐bound algorithm for the capacitated facilities location problem
