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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 206; číslo 1; s. 611 - 626
Hlavní autoři:	Brusco, Michael J., Köhn, Hans Friedrich, Steinley, Douglas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.07.2013 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!