Pages that link to "Item:Q1060845"

The following pages link to Probabilistic bounds for dual bin-packing (Q1060845):

Displaying 23 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)
• Probabilistic behaviour of optimal bin-packing solutions (Q797494) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
• Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
• Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← 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)
• Dual bin packing with items of random sizes (Q1803607) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Probabilistic analysis of a heuristic for the dual bin packing problem (Q1824388) (← links)
• An exact algorithm for the dual bin packing problem (Q1892657) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• Chance-Constrained Binary Packing Problems (Q2940063) (← links)
• Stochastic Analysis of a Modified First Fit Decreasing Packing (Q3359997) (← links)
• Probabilistic analysis of algorithms for dual bin packing problems (Q3361889) (← links)
• (Q4351085) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)