Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes

The bin packing problem is a problem of finding an assignment of a sequence of items to a minimum number of bins, each of capacity one. An online algorithm for the bin packing problem is an algorithm that irrevocably assigns each item one by one from the head of the sequence. Gutin, Jensen, and Yeo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2023/09/01, Vol.E106.A(9), pp.1100-1110
Hauptverfasser:	FUJIWARA, Hiroshi, KAWAGUCHI, Masaya, TAKIZAWA, Daiki, YAMAMOTO, Hiroaki
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms bin packing problem competitive analysis mathematical optimization online algorithm Operations research
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!