Inventory placement in acyclic supply chain networks

Authors:
Thomas L. Magnanti;Zuo-Jun Max Shen;Jia Shu;David Simchi-Levi;Chung-Piaw Teo
Affiliations:
School of Engineering and Sloan School of Management, Massachusetts Institute of Technology, USA;Department of Industrial Engineering and Operations Research, University of California Berkeley, USA;Department of Industrial and Manufacturing Engineering, Wayne State University, Detroit, MI 48202, USA;Department of Civil and Environmental Engineering and Division of Engineering Systems, Massachusetts Institute of Technology, USA;SKK Graduate School of Business, Sungkyunkwan University, South Korea
Venue:
Operations Research Letters
Year:
2006

Citing 7
Cited 3

Some NP-complete problems in quadratic and nonlinear programming

Mathematical Programming: Series A and B
Integer and combinatorial optimization

Integer and combinatorial optimization
Stock Positioning and Performance Estimation in Serial Production-Transportation Systems

Manufacturing & Service Operations Management
Optimizing Strategic Safety Stock Placement in Supply Chains

Manufacturing & Service Operations Management
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science
Correspondence: Erratum: Optimizing Strategic Safety Stock Placement in Supply Chains

Manufacturing & Service Operations Management
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Operations Research

Efficient heuristics for inventory placement in acyclic networks

Computers and Operations Research
TECHNICAL NOTE---Optimizing Strategic Safety Stock Placement in General Acyclic Networks

Operations Research
New model and heuristics for safety stock placement in general acyclic supply chain networks

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.