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.002zbMATH Open1241.90101OpenAlexW2080652530MaRDI QIDQ429692FDOQ429692
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
Recommendations
- Pattern minimisation in cutting stock problems
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Pattern reduction in one-dimensional cutting stock problems
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On LP relaxations for the pattern minimization problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Pattern minimisation in cutting stock problems
- An integrated cutting stock and sequencing problem
- Setup and open-stacks minimization in one-dimensional stock cutting
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- On the equal-subset-sum problem
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- Bin-packing and matchings in threshold graphs
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
Cited In (5)
- 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
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Pattern minimisation in cutting stock problems
Uses Software
This page was built for publication: Cutting stock with no three parts per pattern: work-in-process and pattern minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429692)
