Pages that link to "Item:Q2572248"
From MaRDI portal
The following pages link to Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248):
Displayed 13 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)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← 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)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← 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)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)