Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation

DOI10.1287/IJOC.2023.1277MaRDI QIDQ6203513zbMATH OpenOpenAlexFDO

Authors Sebastian Kraul, Markus Seizinger, Jens O. Brunner

Publication date 28 February 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2023.1277

zbMATH Keywords

cutting stock problemdualitymachine learningparameter optimizationstabilized column generation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• New stabilization procedures for the cutting stock problem
• Cutting Stock Problems
• Dual-Optimal Inequalities for Stabilized Column Generation
• Using extra dual cuts to accelerate column generation
• Accelerating column generation for variable sized bin-packing problems

Cited in

(4)

• Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm
• Last fifty years of integer linear programming: a focus on recent practical advances
• A machine learning approach to rank pricing problems in branch-and-price
• Machine learning-facilitated algorithm for operations optimization in thermal power plants

This page was built for publication: Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation

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