Cutting stock with no three parts per pattern: work-in-process and pattern minimization
From MaRDI portal
Publication:429692
DOI10.1016/j.disopt.2010.10.002zbMath1241.90101OpenAlexW2080652530MaRDI QIDQ429692
Claudio Arbib, Fabrizio Marinelli, Alessandro Aloisio
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.10.002
Related Items
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, A cutting stock problem in the wood products industry: a two‐stage solution approach, Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches, New lower bounds based on column generation and constraint programming for the pattern minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- On the equal-subset-sum problem
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Bin-packing and matchings in threshold graphs
- Pattern minimisation in cutting stock problems
- An integrated cutting stock and sequencing problem
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- On LP relaxations for the pattern minimization problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Graph-Theoretic Concepts in Computer Science
