Approximation schemes for ordered vector packing problems
From MaRDI portal
Publication:4456057
DOI10.1002/NAV.10058zbMATH Open1045.90055OpenAlexW1966797778WikidataQ61638378 ScholiaQ61638378MaRDI QIDQ4456057FDOQ4456057
Authors: Alberto Caprara, Hans Kellerer, Ulrich Pferschy 
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10058
Recommendations
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
Cited In (35)
- Online interval coloring with packing constraints
- Title not available (Why is that?)
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- Scheduling with cardinality dependent unavailability periods
- Selfish bin packing with cardinality constraints
- EPTAS for the dual of splittable bin packing with cardinality constraint
- Class constrained bin covering
- Title not available (Why is that?)
- Bin packing with general cost structures
- On Multidimensional Packing Problems
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- Improved Approximation for Vector Bin Packing
- Bin packing with controllable item sizes
- Offline black and white bin packing
- Vector bin packing with multiple-choice (extended abstract)
- Bin covering with cardinality constraints
- Efficient algorithms for orthogonal packing problems
- Sequential vector packing
- Robust algorithms for preemptive scheduling
- Online bin packing with cardinality constraints resolved
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Algorithms for on-line bin-packing problems with cardinality constraints
- An AFPTAS for variable sized bin packing with general activation costs
- Bin packing with rejection revisited
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Class constrained bin packing revisited
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- Bounds for online bin packing with cardinality constraints
- Title not available (Why is that?)
- Sequential Vector Packing
This page was built for publication: Approximation schemes for ordered vector packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456057)
