Exact algorithms for integrated facility location and production planning problems
From MaRDI portal
Publication:5198685
DOI10.1002/nav.20458zbMath1218.90105OpenAlexW2116415271MaRDI QIDQ5198685
Joseph Geunes, H. Edwin Romeijn, Thomas C. Sharkey, Zuo-Jun Max Shen
Publication date: 9 August 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/86850
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Discrete location and assignment (90B80)
Related Items (4)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic ⋮ Sequential versus integrated optimization: production, location, inventory control, and distribution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms
- Dynamic Version of the Economic Lot Size Model
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Integrating facility location and production planning decisions
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Requirements Planning with Pricing and Order Selection Flexibility
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A composite algorithm for a concave-cost network flow problem
- A Dual-Based Procedure for Dynamic Facility Location
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
- The continuous-time single-sourcing problem with capacity expansion opportunities
- Stochastic Transportation-Inventory Network Design Problem
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Solving the dynamic facility location problem
- A probabilistic analysis of the multi-period single-sourcing problem
This page was built for publication: Exact algorithms for integrated facility location and production planning problems
