Pages that link to "Item:Q2899145"
From MaRDI portal
The following pages link to New stabilization procedures for the cutting stock problem (Q2899145):
Displaying 12 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
- New cases of the cutting stock problem having MIRUP (Q1298738) (← links)
- Stability analysis for a special interval cutting problem (Q1390272) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)