A new model for complete solutions to one-dimensional cutting stock problems.
From MaRDI portal
Publication:1417501
DOI10.1016/S0377-2217(02)00704-XzbMath1053.90038OpenAlexW1986240873MaRDI QIDQ1417501
Robert E. Johnston, Enes Sadinlija
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00704-x
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (14)
Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ A hybrid algorithm for constrained order packing ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ In situ column generation for a cutting-stock problem ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Trim loss optimization by an improved differential evolution ⋮ Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ The one-dimensional cutting stock problem with due dates ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
Cites Work
This page was built for publication: A new model for complete solutions to one-dimensional cutting stock problems.
