New integer programming formulations and an exact algorithm for the ordered cutting stock problem

DOI10.1057/palgrave.jors.2602494zbMath1168.90560OpenAlexW2047615736MaRDI QIDQ3394020

Cláudio Alves, José M. Valério de Carvalho

Publication date: 28 August 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602494

zbMATH Keywords

column generationbranch-and-boundcutting planescutting stockinteger programming modelspattern sequencing

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

The one-dimensional cutting stock problem with due dates

This page was built for publication: New integer programming formulations and an exact algorithm for the ordered cutting stock problem