Bin packing with controllable item sizes

DOI10.1016/j.ic.2008.04.005zbMath1169.90018OpenAlexW2045344534WikidataQ65553914 ScholiaQ65553914MaRDI QIDQ1004389

Leah Epstein, José R. Correa

Publication date: 4 March 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.04.005

zbMATH Keywords

online algorithmsapproximation schemesbin packingdiscrete time-cost tradeoff

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Bin packing under linear constraints ⋮ Vector bin packing with multiple-choice

Cites Work

• Unnamed Item
• There is no asymptotic PTAS for two-dimensional vector packing
• An on-line algorithm for variable-sized bin packing
• Online algorithms. The state of the art
• Online algorithms for a dual version of bin packing
• Bin packing can be solved within 1+epsilon in linear time
• An improved lower bound for on-line bin packing algorithms
• Optimal on-line algorithms for variable-sized bin covering
• 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
• An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• Integer Programming with a Fixed Number of Variables
• AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
• On a dual version of the one-dimensional bin packing problem
• Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
• On the online bin packing problem
• Variable Sized Bin Packing
• A simple on-line bin-packing algorithm
• Improved Space for Bounded-Space, On-Line Bin-Packing
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Approximation schemes for ordered vector packing problems
• New Bounds for Variable-Sized Online Bin Packing
• On-line bin packing in linear time
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Bin Packing with Rejection Revisited

This page was built for publication: Bin packing with controllable item sizes