Pages that link to "Item:Q1364894"
From MaRDI portal
The following pages link to A branch-and-price algorithm for solving the cutting strips problem (Q1364894):
Displaying 8 items.
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- The integration of an interior-point cutting plane method within a branch-and-price algorithm (Q1881560) (← links)
- Computational study of a column generation algorithm for bin packing and cutting stock problems (Q1970365) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- An application of deterministic and robust optimization in the wood cutting industry (Q2342918) (← links)
- Solving the market split problem via branch-and-cut (Q2655892) (← links)