Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1109684
Jump to:navigation, search

DOI10.1016/0167-6377(88)90060-0zbMath0655.90065OpenAlexW1970868200MaRDI QIDQ1109684

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

zbMATH Keywords

heuristicbin-packingnext-fit decreasing algorithmnext-fit increasing algorithm


Mathematics Subject Classification ID

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


Related Items

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



Cites Work

  • Unnamed Item
  • Unnamed Item
  • A probabilistic analysis of the next fit decreasing bin packing heuristic
  • Probabilistic analysis of the next fit decreasing algorithm for bin- packing
  • A stochastic analysis of the NFD bin-packing algorithm
  • On Packing Two-Dimensional Bins
  • A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1109684&oldid=13148541"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki