Framework of algorithm portfolios for strip packing problem

In this paper selection of fast algorithm portfolios for 2SP packing problem is considered. The 2SP problem consists in placing rectangles on a strip of the given width for minimum strip length. The 2SP packing has application in many industries, but suitability of the related algorithms is limited...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & industrial engineering Ročník 172; číslo part A; s. 108538
Hlavní autoři:	Piechowiak, Kamil, Drozdowski, Maciej, Sanlaville, Éric
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.10.2022 Elsevier
Témata:	2D packing Algorithm portfolios Algorithm selection problem Computer Science Heuristics Mathematics Runtime-quality trade-off Algorithm portfolios 2D packing Runtime-quality trade-off Heuristics Algorithm selection problem algorithm portfolios algorithm selection problem runtime-quality trade-off
ISSN:	0360-8352, 1879-0550
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!