Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143421 | Operations Research Letters | 2006 | 11 Pages |
Abstract
By adding a set of redundant constraints, and by iteratively refining the approximation, we show that a commercial solver is able to routinely solve moderate-size strategic safety stock placement problems to optimality. The speed-up arises because the solver automatically generates strong flow cover cuts using the redundant constraints.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, David Simchi-Levi, Chung-Piaw Teo,