Pages that link to "Item:Q322686"
From MaRDI portal
The following pages link to Integer linear programming models for the skiving stock problem (Q322686):
Displaying 16 items.
- 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)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- A new interactive approach for solving fully fuzzy mixed integer linear programming (Q3388800) (← 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)
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries (Q6087622) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- Tool switching problems with tool order constraints (Q6202949) (← links)
