Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds

For an n -period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O ( n 2 ) variables and constraints, also giving an O ( n 2 ) algorithm for the pro...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming 2017, Vol.161 (1-2), p.603-609
Main Author: Wolsey, Laurence A.
Format: Article
Language:English
Subjects:
Algorithms
Calculus of Variations and Optimal Control
Optimization
Combinatorics
Costs
Integer programming
Linear programming
Mathematical analysis
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Short Communication
Studies
Theoretical
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For an n -period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O ( n 2 ) variables and constraints, also giving an O ( n 2 ) algorithm for the problem. This corrects and extends a formulation in Section 4.4 of our article “Lot-sizing with production and delivery time windows”, Mathematical Programming A , 107:471–489, 2006 , for the problem with just stock upper bounds.
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-016-0999-1