Pages that link to "Item:Q1751167"
From MaRDI portal
The following pages link to Integer rounding and modified integer rounding for the skiving stock problem (Q1751167):
Displaying 10 items.
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case (Q4685755) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
