Cutting Stock Problems

DOI10.1007/0-387-25486-2_5MaRDI QIDQ5493630zbMATH OpenOpenAlexFDO

Authors Hatem M. T. Ben Amor, José Valério de Carvalho

Publication date 16 October 2006

Published in Column Generation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-25486-2_5

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3916002
• Optimal Integer Solutions to Industrial Cutting Stock Problems
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
• Solving binary cutting stock problems by column generation and branch- and-bound
• scientific article; zbMATH DE number 1050896

Cited in

(32)

• An inexact bundle variant suited to column generation
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• New cases of the cutting stock problem having MIRUP
• Solving binary cutting stock problems by column generation and branch- and-bound
• The cutting stock problem in a hardboard industry: A case study.
• Row and column generation technique for a multistage cutting stock problem
• The cutting stock problem in the canvas industry
• Modeling multistage cutting stock problems
• New exact techniques applied to a class of network flow formulations
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• A lexicographic pricer for the fractional bin packing problem
• Simultaneously exploiting two formulations: an exact Benders decomposition approach
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
• Dual inequalities for stabilized column generation revisited
• Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
• New stabilization procedures for the cutting stock problem
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• scientific article; zbMATH DE number 3885649 (Why is no real title available?)
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• scientific article; zbMATH DE number 5688457 (Why is no real title available?)
• A stabilized structured Dantzig-Wolfe decomposition method
• Progressive selection method for the coupled lot-sizing and cutting-stock problem
• Exploiting packing components in general-purpose integer programming solvers
• Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
• Projective cutting-planes
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
• Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
• Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
• Stabilized branch-and-price algorithms for vector packing problems
• A generalization of column generation to accelerate convergence
• In situ column generation for a cutting-stock problem

This page was built for publication: Cutting Stock Problems

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