scientific article; zbMATH DE number 6842581

zbMATH Open1399.68068MaRDI QIDQ4605573FDOQ4605573

Authors:

Publication date: 22 February 2018

Title of this publication is not available (Why is that?)

Recommendations

• Dynamic bin packing with unit fraction items revisited
• Automata, Languages and Programming
• Dynamic bin packing of unit fractions items
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• A tight lower bound for optimal bin packing
• Optimal Bin Packing with Items of Random Sizes
• Bin packing: Asymptotically exact approach
• The optimal absolute ratio for online bin packing
• The optimal absolute ratio for online bin packing
• Optimal Bin Packing with Items of Random Sizes II

zbMATH Keywords

bin packingoptimal algorithmfirst fitunit fraction bin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cited In (7)

• Universal number partition problem with divisibility
• Bin packing with divisible item sizes and rejection penalties
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• On Packing Splittable Items with Cardinality Constraints
• Dynamic bin packing with unit fraction items revisited
• Relations between capacity utilization, minimal bin size and bin number
• PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM

This page was built for publication:

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