An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type

DOI10.1016/0305-0548(91)90087-8zbMath0734.90047OpenAlexW2073527569MaRDI QIDQ811349

Choong Y. Lee

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90087-8

zbMATH Keywords

cutting planesBenders' decompositiontransportation costsmultiproduct capacitated facility location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

A cross decomposition algorithm for a multiproduct-multitype facility location problem ⋮ A tabu search algorithm for application placement in computer clustering ⋮ Solution method for the location planning problem of logistics park with variable capacity ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ Incorporating cellular manufacturing into supply chain design ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ A \(k\)-product uncapacitated facility location problem ⋮ A hierarchical solution approach for a multicommodity distribution problem under a special cost structure ⋮ An algorithm for the capacitated, multi-commodity multi-period facility location problem. ⋮ Integrated design and operation of remnant inventory supply chains under uncertainty ⋮ Integrated production/distribution planning in supply chains: An invited review ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Modeling and solving a logging camp location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• Heuristics for the capacitated plant location model
• A partial dual algorithm for the capacitated warehouse location problem
• ADD-heuristics' starting procedures for capacitated plant location models
• Partitioning procedures for solving mixed-variables programming problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Generalized Benders decomposition
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Linear Relaxations of the Capacitated Warehouse Location Problem
• 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
• An Improved Algorithm for the Capacitated Facility Location Problem
• Cross decomposition for mixed integer programming
• A branch‐bound algorithm for the capacitated facilities location problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

This page was built for publication: An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type