An algorithm for the capacitated, multi-commodity multi-period facility location problem.
From MaRDI portal
Publication:5932338
DOI10.1016/S0305-0548(99)00126-4zbMath1080.90535OpenAlexW2000318055WikidataQ115023227 ScholiaQ115023227MaRDI QIDQ5932338
Basheer M. Khumawala, Cem Canel, Anthony Wai-keung Loh, Japhett Law
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00126-4
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs, Integrated strategic and tactical supply chain planning with price-sensitive demands, Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction, Efficient primal-dual heuristic for a dynamic location problem, Solving a dynamic facility location problem with partial closing and reopening, Dynamic location of modular manufacturing facilities with relocation of individual modules, Location and design decisions of facilities in a distribution system with elastic customer demand, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Optimization models for the dynamic facility location and allocation problem, An efficient heuristic approach for a multi-period logistics network redesign problem, Fuzzy group decision-making for facility location selection., Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods, A hierarchical solution approach for a multicommodity distribution problem under a special cost structure, An algorithm for solving the multi-period online fulfillment assignment problem, Designing a two-echelon distribution network under demand uncertainty, Heuristics for the dynamic facility location problem with modular capacities, Modeling and solving a logging camp location problem, Facility location and supply chain management. A review, Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning, Notation and classification for logistic network design models, Uncapacitated and Capacitated Facility Location Problems
Cites Work
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Facility location models for distribution planning
- A comparative study of approaches to dynamic location problems
- Locational analysis
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- The simple plant location problem: Survey and synthesis
- A heuristic solution procedure for multicommodity integer flows
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- An Overview of Representative Problems in Location Research
- An Improved Algorithm for the Multi-Commodity Location Problem
- A Dual-Based Procedure for Dynamic Facility Location
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- An efficient heuristic procedure for the capacitated warehouse location problem
- Multicommodity Distribution System Design by Benders Decomposition
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- An Improved Long-Run Model for Multiple Warehouse Location
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- Multi-Dimensional Location Problems
