Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

DOI10.1016/J.DAM.2023.04.003zbMATH Open1518.90090OpenAlexW4366608284MaRDI QIDQ6157429FDOQ6157429

J. Martinovic, Laura Korbacher, Nico Strasdat, Stefan Irnich

Publication date: 11 May 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.04.003

Recommendations

• Improved flow-based formulations for the skiving stock problem
• Integer linear programming models for the skiving stock problem
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• Cutting Stock Problems
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound

zbMATH Keywords

column generationpackingcuttingskiving stock problemflow formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Benchmarking optimization software with performance profiles.
• Title not available (Why is that?)
• A Linear Programming Approach to the Cutting-Stock Problem
• On a dual version of the one-dimensional bin packing problem
• Title not available (Why is that?)
• Exact solution of bin-packing problems using column generation and branch-and-bound
• LP models for bin packing and cutting stock problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Column Generation
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
• Integer rounding and modified integer rounding for the skiving stock problem
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• An exact algorithm for the dual bin packing problem
• Friendly bin packing instances without integer round-up property
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
• Using extra dual cuts to accelerate column generation
• Integer linear programming models for the skiving stock problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Dual-Optimal Inequalities for Stabilized Column Generation
• Bin packing and related problems: general arc-flow formulation with graph compression
• A New Linear Programming Approach to the Cutting Stock Problem
• Title not available (Why is that?)
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The skiving stock problem as a counterpart of the cutting stock problem
• Dual inequalities for stabilized column generation revisited
• Improved flow-based formulations for the skiving stock problem
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• The proper relaxation and the proper gap of the skiving stock problem
• Path-reduced costs for eliminating arcs in routing and scheduling
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Stabilized branch-and-price algorithms for vector packing problems
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• Exact solution of network flow models with strong relaxations

Cited In (2)

• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The proper relaxation and the proper gap of the skiving stock problem

This page was built for publication: Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

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