Pages that link to "Item:Q3361889"
From MaRDI portal
The following pages link to Probabilistic analysis of algorithms for dual bin packing problems (Q3361889):
Displaying 23 items.
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- 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)
- Selfish bin covering (Q650947) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- Online algorithms for a dual version of bin packing (Q1112608) (← links)
- Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← 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)
- Probabilistic analysis of a heuristic for the dual bin packing problem (Q1824388) (← links)
- Online variable sized covering (Q1854485) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Probabilistic analysis of a bin covering algorithm (Q1919189) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Probabilistic analysis of online (class-constrained) bin packing and bin covering (Q2294707) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
- Probabilistic analysis of algorithms for the Dutch national flag problem (Q2566022) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- (Q4351085) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)