scientific article; zbMATH DE number 797002
From MaRDI portal
Publication:4848284
zbMath0831.90091MaRDI QIDQ4848284
Guntram Scheithauer, Johannes Terno
Publication date: 18 February 1996
Full work available at URL: https://eudml.org/doc/219122
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)
Related Items (12)
Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ On the bin packing problem with a fixed number of object weights ⋮ The modified integer round-up property of the one-dimensional cutting stock problem ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ The stochastic trim-loss problem ⋮ Tighter relaxations for the cutting stock problem ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
This page was built for publication:
