Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
From MaRDI portal
Publication:2884549
DOI10.1287/ijoc.15.1.58.15156zbMath1238.90129OpenAlexW2025495858MaRDI QIDQ2884549
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.1.58.15156
Related Items
A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ The generalized assortment and best cutting stock length problems ⋮ Comparison of bundle and classical column generation ⋮ One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ An inexact bundle variant suited to column generation ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ The one-dimensional cutting stock problem with due dates ⋮ An linear programming based lower bound for the simple assembly line balancing problem ⋮ Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
Uses Software
