Pages that link to "Item:Q4051589"

The following pages link to Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589):

Displaying 50 items.

• Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
• Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
• Shelf algorithms for on-line strip packing (Q287167) (← links)
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
• An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
• Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
• Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
• Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
• Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
• Selfish bin packing with cardinality constraints (Q391143) (← links)
• Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
• On the absolute approximation ratio for first fit and related results (Q442205) (← links)
• Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
• Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
• A note on online hypercube packing (Q623793) (← links)
• A new version of on-line variable-sized bin packing (Q674434) (← links)
• Approximation algorithms for time constrained scheduling (Q676776) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
• A storage-size selection problem (Q795502) (← links)
• Online bin packing with overload cost (Q831684) (← links)
• Bin packing with rejection revisited (Q848845) (← links)
• Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
• Resource augmented semi-online bounded space bin packing (Q967321) (← links)
• Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
• Two-dimensional online bin packing with rotation (Q982663) (← links)
• A note on online strip packing (Q1029271) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
• Convergence of optimal stochastic bin packing (Q1062627) (← links)
• An O(n) bin-packing algorithm for uniformly distributed data (Q1065544) (← links)
• A 71/60 theorem for bin packing (Q1083194) (← links)
• Heuristic evaluation techniques for bin packing approximation algorithms (Q1083199) (← links)
• Bin packing as a random walk: A note on Knödel's paper (Q1084021) (← links)
• The fleet size and mix vehicle routing problem (Q1085780) (← links)
• On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
• The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
• Bin packing with divisible item sizes (Q1100914) (← links)
• Online variable-sized bin packing (Q1111472) (← links)
• Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
• Expected performance of the shelf heuristic for 2-dimensional packing (Q1121176) (← links)
• Parallel approximation algorithms for bin packing (Q1123807) (← links)
• An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
• Bin packing: Maximizing the number of pieces packed (Q1133327) (← links)