Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Online bin packing with advice of small size
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Bin packing with restricted piece sizes
- Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Online results for black and white bin packing
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- Approximation scheduling algorithms: a survey
- Online bin packing with overload cost
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Better bin packing approximations via discrepancy theory
- Several methods of analysis for cardinality constrained bin packing
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Selfish bin packing with cardinality constraints
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Average-case analyses of first fit and random fit bin packing
- Bin packing with divisible item sizes
- An efficient job scheduling algorithm in partitionable mesh connected systems
- An improved mechanism for selfish bin packing
- An on-line graph coloring algorithm with sublinear performance ratio
- Bin packing with general cost structures
- The class constrained bin packing problem with applications to video-on-demand
- A bin packing problem with over-sized items
- Deep performance analysis of refined harmonic bin packing algorithm
- Product packing and stacking under uncertainty: a robust approach
- Best fit bin packing with random order revisited
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- One-dimensional bin packing with pattern-dependent processing time
- Scheduling a single batch processing machine with non-identical job sizes
- Online bin packing with advice of small size
- Two-dimensional rectangle packing: On-line methods and results
- Best fit bin packing with random order revisited
- Lower bounds for on-line graph coloring
- An improved BL lower bound
- Two-dimensional online bin packing with rotation
- On the generalized bin packing problem
- A 71/60 theorem for bin packing
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- Bin packing can be solved within 1+epsilon in linear time
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Shelf algorithms for on-line strip packing
- scientific article; zbMATH DE number 809154 (Why is no real title available?)
- Online bin packing of squares and cubes
- Repacking helps in bounded space on-line bin-packing
- Heuristic evaluation techniques for bin packing approximation algorithms
- Average-case analysis of the smart next fit algorithm
- Interior-point-based online stochastic bin packing
- A new version of on-line variable-sized bin packing
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Heuristic methods and applications: A categorized survey
- A generalized bin packing problem for parcel delivery in last-mile logistics
- NF-based algorithms for online bin packing with buffer and bounded item size
- On-line scheduling of jobs with fixed start and end times
- More on batched bin packing
- Worst-case analysis of the subset sum algorithm for bin packing.
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Assembly line balancing as generalized bin packing
- Locality-preserving allocations problems and coloured bin packing
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- The tight absolute bound of First Fit in the parameterized case
- Approximation algorithms for the design of SDH/SONET networks
- Linear time-approximation algorithms for bin packing
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Lower bounds for batched bin packing
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Integer programming duality: Price functions and sensitivity analysis
- Analysis of Stochastic Online Bin Packing Processes
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing
- On the absolute approximation ratio for first fit and related results
- A storage-size selection problem
- Convergence of optimal stochastic bin packing
- Algorithms for the variable sized bin packing problem
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
- Recent advances on two-dimensional bin packing problems
- Applying extra-resource analysis to load balancing.
- Multi-machine energy-aware scheduling
- New bounds on the price of anarchy of selfish bin packing with partial punishment
- Tight performance bound of \(AFBk\) bin packing
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A mixed‐integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- The average-case analysis of some on-line algorithms for bin packing
- Computing redundant resources for the resource constrained project scheduling problem
- Online variable-sized bin packing
- Expected performance of the shelf heuristic for 2-dimensional packing
- Parallel approximation algorithms for bin packing
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- A lower bound for on-line bin packing
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- A new lower bound for classic online bin packing
- Efficient algorithms for the offline variable sized bin-packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Online bin packing with cardinality constraints resolved
This page was built for publication: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051589)
