On the Wagner-Whitin Lot-Sizing Polyhedron

DOI10.1287/MOOR.26.3.591.10586zbMath1073.90575OpenAlexW2106298042MaRDI QIDQ2757684

Olivier Pereira, Laurence A. Wolsey

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7d045f03f4570200849d5d5c70acb4c25490679f

zbMATH Keywords

Polyhedra, proof of integrality, adjacency, maximal faces, dual algorithm, lot-sizing, Wagner-Whitin costs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Boolean programming (90C09)

Related Items (2)

Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Single-item dynamic lot-sizing problems: an updated survey

This page was built for publication: On the Wagner-Whitin Lot-Sizing Polyhedron