A polyhedral approach to a production planning problem

DOI10.1023/A:1018963805173zbMath0997.90031OpenAlexW55804789MaRDI QIDQ1593522

Miguel Fragoso Constantino

Publication date: 17 January 2001

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

Full work available at URL: https://doi.org/10.1023/a:1018963805173

zbMATH Keywords

production planningvalid inequalitiescutting plane algorithm

Mathematics Subject Classification ID

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

Related Items (5)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ Description of 2-integer continuous knapsack polyhedra ⋮ Uncapacitated lot sizing with backlogging: the convex hull

This page was built for publication: A polyhedral approach to a production planning problem