Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
From MaRDI portal
Publication:2892308
DOI10.1287/ijoc.1050.0132zbMath1241.90070MaRDI QIDQ2892308
Guntram Scheithauer, Gleb Belov
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/deaa81338159acc5ec6ab4cfa5bc021b2657dac1
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Related Items
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais