Pages that link to "Item:Q4051589"
From MaRDI portal
The following pages link to Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589):
Displayed 50 items.
- 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)
- A storage-size selection problem (Q795502) (← 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)
- A lower bound for on-line bin packing (Q1144944) (← links)
- An improved BL lower bound (Q1144945) (← links)
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- Assembly line balancing as generalized bin packing (Q1167660) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- Two-dimensional rectangle packing: On-line methods and results (Q1309806) (← links)
- A branch-and-bound algorithm for the two-dimensional vector packing problem (Q1317086) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- Tight performance bound of \(AFBk\) bin packing (Q1375348) (← links)
- Edge disjoint Polyp Packing (Q1377661) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)