Bin Packing with Rejection Revisited

DOI10.1007/11970125_12MaRDI QIDQ5443516zbMATH OpenOpenAlexFDO

Authors Leah Epstein

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_12

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Bin packing with rejection revisited
• Computing and Combinatorics
• Bin packing problems with rejection penalties and their dual problems
• A fast asymptotic approximation scheme for bin packing with rejection
• A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

Cited in

(14)

• Bin packing with controllable item sizes
• Bin packing with divisible item sizes and rejection penalties
• Minimizing the makespan on a single parallel batching machine
• 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
• Black and White Bin Packing Revisited
• A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
• The bin-packing problem with rejection cost and a heuristic algorithm
• Computing and Combinatorics
• The entropy rounding method in approximation algorithms
• Bin packing with rejection revisited
• Online coupon consumption problem
• Online unit clustering: Variations on a theme

This page was built for publication: Bin Packing with Rejection Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443516)