Dantzig-Wolfe decomposition for the facility location and production planning problem
From MaRDI portal
Publication:2664417
DOI10.1016/j.cor.2020.105068zbMath1458.90464OpenAlexW3048241735MaRDI QIDQ2664417
Zhongshun Shi, Canrong Zhang, Zhe Liang, Xiaoning Zhang, Tao Wu
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105068
column generationmixed integer programmingproduction planningfacility locationlot-sizingitem decompositionproduction distribution
Mixed integer programming (90C11) Production models (90B30) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
A supervised learning-driven heuristic for solving the facility location and production planning problem, Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover, Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs
Cites Work
- Unnamed Item
- Hybrid methods for lot sizing on parallel machines
- A branch-and-price algorithm for the capacitated facility location problem
- Plant location with minimum inventory
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- The green capacitated multi-item lot sizing problem with parallel machines
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- On the Wagner-Whitin Lot-Sizing Polyhedron
- Dynamic Version of the Economic Lot Size Model
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Integrating facility location and production planning decisions
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- Exact algorithms for integrated facility location and production planning problems
- Column Generation
- Stochastic Transportation-Inventory Network Design Problem
- Production Planning by Mixed Integer Programming
- An Efficient Algorithm for Multi-Item Scheduling
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A probabilistic analysis of the multi-period single-sourcing problem
