Bin packing with general cost structures
From MaRDI portal
Publication:2429476
DOI10.1007/s10107-010-0403-5zbMath1274.90304OpenAlexW1677873712MaRDI QIDQ2429476
Publication date: 27 April 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0403-5
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
Online bin packing with overload cost ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ Parameterized complexity of configuration integer programs ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ A faster FPTAS for knapsack problem with cardinality constraint ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ A faster FPTAS for knapsack problem with cardinality constraint ⋮ Offline black and white bin packing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing with rejection revisited
- Bin packing can be solved within 1+epsilon in linear time
- Approximation algorithms for knapsack problems with cardinality constraints
- Fast algorithms for bin packing
- A fast asymptotic approximation scheme for bin packing with rejection
- Bin packing problems with rejection penalties and their dual problems
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- On the online bin packing problem
- On strip packing With rotations
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A simple on-line bin-packing algorithm
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- Approximation schemes for ordered vector packing problems
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Online Bin Packing with Cardinality Constraints
- Bin‐packing problem with concave costs of bin utilization
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
This page was built for publication: Bin packing with general cost structures
