Pages that link to "Item:Q3219761"

The following pages link to On a dual version of the one-dimensional bin packing problem (Q3219761):

Displaying 22 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• Online bin covering: expectations vs. guarantees (Q300236) (← links)
• Integer linear programming models for the skiving stock problem (Q322686) (← links)
• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
• Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← 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)
• Class constrained bin covering (Q970104) (← links)
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
• On the sum minimization version of the online bin covering problem (Q987687) (← links)
• Bin packing with controllable item sizes (Q1004389) (← links)
• Hardness of lazy packing and covering (Q1015303) (← links)
• Bounded-space online bin cover (Q1041340) (← 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)
• Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
• Online variable sized covering (Q1854485) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• A note on an open-end bin packing problem (Q5946719) (← links)