An AFPTAS for variable sized bin packing with general activation costs
From MaRDI portal
Publication:340560
DOI10.1016/j.jcss.2016.07.007zbMath1353.68120OpenAlexW2527257938MaRDI QIDQ340560
Publication date: 14 November 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.07.007
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Online bin packing with overload cost, Approximation schemes for the generalized extensible bin packing problem, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing makespan and preemption costs on a system of uniform machines
- Bin packing with rejection revisited
- An asymptotic approximation scheme for the concave cost bin packing problem
- Class constrained bin packing revisited
- Bin packing can be solved within 1+epsilon in linear time
- Fast algorithms for bin packing
- Bin packing with general cost structures
- A fast asymptotic approximation scheme for bin packing with rejection
- The class constrained bin packing problem with applications to video-on-demand
- The Train Delivery Problem - Vehicle Routing Meets Bin Packing
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- Handbook of Approximation Algorithms and Metaheuristics
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Approximation schemes for covering and packing problems in image processing and VLSI
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Approximation schemes for ordered vector packing problems
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Bin‐packing problem with concave costs of bin utilization
