Pages that link to "Item:Q3219761"

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

Displaying 50 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)
• Bin packing with divisible item sizes (Q1100914) (← links)
• Online algorithms for a dual version of bin packing (Q1112608) (← links)
• Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
• Parameterized on-line open-end bin packing (Q1387710) (← links)
• Polytopes, permutation shapes and bin packing (Q1398288) (← links)
• An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473) (← 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)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Bin packing with restricted piece sizes (Q1825652) (← 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)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• Lower bounds for online bin covering-type problems (Q2304119) (← links)
• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← 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)
• Comparing online algorithms for bin packing problems (Q2434261) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)
• Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
• The maximum resource bin packing problem (Q2508970) (← links)
• Online bin covering with limited migration (Q2689369) (← links)
• Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
• An Incentive Mechanism for Selfish Bin Covering (Q2958351) (← 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)
• On-line bin packing ? A restricted survey (Q4845093) (← links)
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
• Online Bin Covering with Limited Migration (Q5075753) (← links)