Next-fit packs a list and its reverse into the same number of bins

DOI10.1016/0167-6377(88)90060-0zbMATH Open0655.90065OpenAlexW1970868200MaRDI QIDQ1109684FDOQ1109684

Authors: David C. Fisher 

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90060-0

Recommendations

• Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
• Best \(k\)-fit bin packing
• Algorithm NextFit for the bin packing problem
• scientific article; zbMATH DE number 4050974
• Publication:4205077

zbMATH Keywords

heuristicbin-packingnext-fit decreasing algorithmnext-fit increasing algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• On Packing Two-Dimensional Bins
• A stochastic analysis of the NFD bin-packing algorithm
• A probabilistic analysis of the next fit decreasing bin packing heuristic
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• Title not available (Why is that?)
• Probabilistic analysis of the next fit decreasing algorithm for bin- packing

Cited In (4)

• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• More on batched bin packing
• On-line bin packing ? A restricted survey
• A note on a selfish bin packing problem

This page was built for publication: Next-fit packs a list and its reverse into the same number of bins

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