Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A note on online strip packing
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Market-based pricing in grids: on strategic manipulation and computational cost
- Convergence of optimal stochastic bin packing
- An O(n) bin-packing algorithm for uniformly distributed data
- A 71/60 theorem for bin packing
- Heuristic evaluation techniques for bin packing approximation algorithms
- Bin packing as a random walk: A note on Knödel's paper
- The fleet size and mix vehicle routing problem
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- The average-case analysis of some on-line algorithms for bin packing
- Bin packing with divisible item sizes
- Online variable-sized bin packing
- Average-case analysis of the smart next fit algorithm
- Expected performance of the shelf heuristic for 2-dimensional packing
- Parallel approximation algorithms for bin packing
- An on-line graph coloring algorithm with sublinear performance ratio
- Bin packing: Maximizing the number of pieces packed
- A lower bound for on-line bin packing
- An improved BL lower bound
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Bin packing can be solved within 1+epsilon in linear time
- Assembly line balancing as generalized bin packing
- Repacking helps in bounded space on-line bin-packing
- Resource constrained scheduling as generalized bin packing
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
- Two-dimensional rectangle packing: On-line methods and results
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Lower bounds for on-line graph coloring
- On-line scheduling of jobs with fixed start and end times
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Worst-case analysis of fast heuristics for packing squares into a square
- Tight performance bound of \(AFBk\) bin packing
- Edge disjoint Polyp Packing
- On linear lower bounds for the resource constrained project scheduling problem.
- Parametric on-line algorithms for packing rectangles and boxes.
- Worst-case analysis of the subset sum algorithm for bin packing.
- Three-dimensional orthogonal graph drawing algorithms
- Applying extra-resource analysis to load balancing.
- Linear time-approximation algorithms for bin packing
- A bin packing problem with over-sized items
- Deep performance analysis of refined harmonic bin packing algorithm
- Bin packing under linear constraints
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- Offline first-fit decreasing height scheduling of power loads
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
- Product packing and stacking under uncertainty: a robust approach
- The intermediate price of anarchy (IPoA) in bin packing games
- Matheuristics for the irregular bin packing problem with free rotations
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- Vehicle minimization for periodic deliveries
- More on batched bin packing
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Heuristic methods and applications: A categorized survey
- Bin packing with restricted piece sizes
- Average-case analysis of the modified harmonic algorithm
- Bin packing and multiprocessor scheduling problems with side constraint on job types
- Algorithms for the variable sized bin packing problem
- Algorithms for on-line bin-packing problems with cardinality constraints
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Best fit bin packing with random order revisited
- Selfish vector packing
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- Online packing of arbitrary sized items into designated and multipurpose bins
- Batch scheduling of nonidentical job sizes with minsum criteria
- From packing rules to cost-sharing mechanisms
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Lower bounds for batched bin packing
- Lower bounds on the performance of online algorithms for relaxed packing problems
- Online bin packing with cardinality constraints resolved
- Efficient 1-space bounded hypercube packing algorithm
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Fully dynamic bin packing revisited
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Online bin packing with advice of small size
- A lower bound for online rectangle packing
- Online results for black and white bin packing
- Locality-preserving allocations problems and coloured bin packing
- The tight absolute bound of First Fit in the parameterized case
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- NF-based algorithms for online bin packing with buffer and bounded item size
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- A note on a selfish bin packing problem
- Multi-machine energy-aware scheduling
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin packing problem with scenarios
- A study on load-balanced variants of the bin packing problem
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Bin packing with general cost structures
- Comparing online algorithms for bin packing problems
- Efficient algorithms for the offline variable sized bin-packing problem
- Online bin packing with arbitrary release times
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)
