Pages that link to "Item:Q3163667"
From MaRDI portal
The following pages link to A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667):
Displaying 14 items.
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- Optimal job splitting on a multi-slot machine with applications in the printing industry (Q3553743) (← links)
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667) (← links)
