Pages that link to "Item:Q1025240"
From MaRDI portal
The following pages link to New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240):
Displaying 10 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- The min-conflict packing problem (Q1761135) (← links)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667) (← links)
