Dantzig-Wolfe decomposition for the facility location and production planning problem
Authors:
- Tao WuTWTao Wu
- Zhongshun ShiZSZhongshun Shi
- Zhe LiangZLZhe Liang
- Xiaoning ZhangXZXiaoning Zhang
- Canrong ZhangCZCanrong Zhang
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 124
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 44 references indexed in Scilit:
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problemOptimization Methods and Software, 2009
- Integrating facility location and production planning decisionsNetworks, 2009
- A branch-and-price algorithm for the capacitated facility location problemEuropean Journal of Operational Research, 2007
- A generic view of Dantzig–Wolfe decomposition in mixed integer programmingOperations Research Letters, 2006
- Improved lower bounds for the capacitated lot sizing problem with setup timesOperations Research Letters, 2004
- A probabilistic analysis of the multi-period single-sourcing problemDiscrete Applied Mathematics, 2001
- Computationally efficient solution of the multi-item, capacitated lot-sizing problemComputers & Industrial Engineering, 1995
- An efficient implementation of the Wagner‐Whitin algorithm for dynamic lot‐sizingJournal of Operations Management, 1985
- Lagrangean relaxation for integer programming1974