The class constrained bin packing problem with applications to video-on-demand
From MaRDI portal
Publication:2481969
DOI10.1016/j.tcs.2008.01.001zbMath1135.68636OpenAlexW2032887760MaRDI QIDQ2481969
Flávio K. Miyazawa, Eduardo Candido Xavier
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.001
Related Items
Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ Selfish bin coloring ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Comparing online algorithms for bin packing problems ⋮ BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ Class constrained bin packing revisited ⋮ Lower bounds for several online variants of bin packing ⋮ A note on dual approximation algorithms for class constrained bin packing problems ⋮ Bin packing with directed stackability conflicts ⋮ Locality-preserving allocations problems and coloured bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight bounds for online class-constrained packing
- Approximation schemes for knapsack problems with shelf divisions
- Design and implementation of scalable continuous media servers
- Bin packing can be solved within 1+epsilon in linear time
- An improved lower bound for on-line bin packing algorithms
- Polynomial time approximation schemes for class-constrained packing problems
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Parametric on-line algorithms for packing rectangles and boxes.
- Fast algorithms for bin packing
- The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- The Co-Printing Problem: A Packing Problem with a Color Constraint
- Algorithms for non-uniform size data placement on parallel disks
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- On two class-constrained versions of the multiple knapsack problem
