Exact and approximate methods for a one-dimensional minimax bin-packing problem

One-dimensional bin-packing problems require the assignment of a collection of items to bins with the goal of optimizing some criterion related to the number of bins used or the ‘weights’ of the items assigned to the bins. In many instances, the number of bins is fixed and the goal is to assign the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 206; H. 1; S. 611 - 626
Hauptverfasser:	Brusco, Michael J., Köhn, Hans Friedrich, Steinley, Douglas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.07.2013 Springer Springer Nature B.V
Schlagworte:	Algorithms Analysis Approximation Bins Business and Management Combinatorial optimization Combinatorics Integer programming Linear programming Mathematical analysis Mathematical programming Methods Minimax technique Operations research Operations Research/Decision Theory Optimization Packing problem Quantitative psychology Simulated annealing Simulated annealing (Mathematics) Software Software packages Statistics Studies Theory of Computation United States Integer programming One-dimensional bin-packing Combinatorial optimization Test splitting Simulated annealing
ISSN:	0254-5330, 1572-9338
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!