A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
From MaRDI portal
Publication:1754107
DOI10.1016/j.ejor.2017.10.008zbMath1403.90581OpenAlexW2766702701MaRDI QIDQ1754107
John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.008
Related Items (17)
An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Tool switching problems with tool order constraints ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem ⋮ Improved flow-based formulations for the skiving stock problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Integer linear programming models for the skiving stock problem
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Bin packing and related problems: general arc-flow formulation with graph compression
- The proper relaxation and the proper gap of the skiving stock problem
- Cutting and packing optimization. Problems modeling and solution methods.
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Large gaps in one-dimensional cutting stock problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- The modified integer round-up property of the one-dimensional cutting stock problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Optimization of roll cutting in clothing industry
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- The cutting stock problem in a hardboard industry: A case study.
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Tighter relaxations for the cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- LP models for bin packing and cutting stock problems
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Accelerating column generation for variable sized bin-packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Integer linear programming for a cutting problem in the wood-processing industry: a case study
- A New Linear Programming Approach to the Cutting Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- The skiving stock problem as a counterpart of the cutting stock problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
