Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results

DOI10.1287/IJOC.15.1.58.15156zbMATH Open1238.90129OpenAlexW2025495858MaRDI QIDQ2884549FDOQ2884549

Authors: Zeger Degraeve, Marc Peeters 

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

Recommendations

• Optimal Integer Solutions to Industrial Cutting Stock Problems
• Optimal solutions for the cutting stock problem
• Solving binary cutting stock problems by column generation and branch- and-bound
• scientific article; zbMATH DE number 1050896
• Cutting Stock Problems

zbMATH Keywords

integer programmingbranch and pricecutting-stock

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cited In (28)

• 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
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
• The generalized assortment and best cutting stock length problems
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• Optimal Integer Solutions to Industrial Cutting Stock Problems
• The one-dimensional cutting stock problem with due dates
• Classification and literature review of integrated lot-sizing and cutting stock problems
• A residual recombination heuristic for one-dimensional cutting stock problems
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
• Progressive selection method for the coupled lot-sizing and cutting-stock problem
• New exact techniques applied to a class of network flow formulations
• Comparison of bundle and classical column generation
• Determining the \(K\)-best solutions of knapsack problems
• On the one-dimensional stock cutting problem in the paper tube industry
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Optimal solutions for the cutting stock 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
• Accelerating column generation for variable sized bin-packing problems
• An inexact bundle variant suited to column generation
• BPPLIB: a library for bin packing and cutting stock problems
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
• Period decompositions for the capacitated lot sizing problem with setup times

Uses Software

• LINDO

This page was built for publication: Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884549)