A note on dual approximation algorithms for class constrained bin packing problems
From MaRDI portal
Publication:3625691
DOI10.1051/ita:2008027zbMath1166.68368OpenAlexW2160306680MaRDI QIDQ3625691
Flávio K. Miyazawa, Eduardo Candido Xavier
Publication date: 6 May 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_2_239_0/
Related Items (2)
Non-preemptive Scheduling on Machines with Setup Times ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Tight bounds for online class-constrained packing
- Approximation schemes for knapsack problems with shelf divisions
- The constrained compartmentalised knapsack problem
- Design and implementation of scalable continuous media servers
- Polynomial time approximation schemes for class-constrained packing problems
- Multiprocessor scheduling with machine allotment and parallelism constraints
- A two-phase roll cutting problem
- The class constrained bin packing problem with applications to video-on-demand
- A one-dimensional bin packing problem with shelf divisions
- The one dimensional Compartmentalised Knapsack problem: a case study
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- 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
This page was built for publication: A note on dual approximation algorithms for class constrained bin packing problems