Maximizing the number of mixed packages subject to variety constraints

We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a pseudo-polynomial procedure to actually implement that optimal solution. The specific application is the allocation of excess of a population of various ty...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 26; číslo 13; s. 1323 - 1333
Hlavní autoři:	Robb, David J., Trietsch, Dan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier Ltd 01.11.1999 Elsevier Science Pergamon Press Inc
Témata:	Algorithms Applied sciences Bin packing Christmas Exact sciences and technology Greeting cards Mathematical programming Operational research and scientific management Operational research. Management science Operations research Packaging Polynomial algorithm Pseudo-polynomial Seasonal products Studies Style goods Seasonal products Bin packing Style goods Polynomial algorithm Pseudo-polynomial Integer programming Maximization Constraint Optimal solution Bin packing problem Variety Polynomial time
ISSN:	0305-0548, 1873-765X, 0305-0548
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!