Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
In this work, the Bin Packing combinatorial optimization problem is studied from the practical side. The focus is on the Falkenauer T benchmark class, which is a collection of 80 problem instances that are considered hard to handle algorithmically. Contrary to this widely accepted view, we show that...
-д хадгалсан:
| Үндсэн зохиолчид: | , , , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
MDPI AG
2025-02-01
|
| Цуврал: | Algorithms |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://www.mdpi.com/1999-4893/18/2/115 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|