The bin-packing problem with rejection cost and a heuristic algorithm

DOI10.3969/J.ISSN.1672-8513.2012.01.008MaRDI QIDQ4901211zbMATH OpenFDO

Authors S. M. Gong, Xiaohui Zhang, Shaokun Li

Publication date 24 January 2013

Full work available at URL https://doi.org/10.3969/J.ISSN.1672-8513.2012.01.008

zbMATH Keywords

bin-packing problemheuristic algorithmrejection cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Bin Packing with Rejection Revisited
• 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

Cited in

(2)

• A fast asymptotic approximation scheme for bin packing with rejection
• Bin packing with rejection revisited

This page was built for publication: The bin-packing problem with rejection cost and a heuristic algorithm

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