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

Full description

Bibliographic Details

Published in:	Algorithms
Main Authors:	György Dósa, András Éles, Angshuman Robin Goswami, István Szalkai, Zsolt Tuza
Format:	Article
Language:	English
Published:	MDPI AG 2025-02-01
Subjects:	bin packing benchmark problem heuristic algorithm Falkenauer T
Online Access:	https://www.mdpi.com/1999-4893/18/2/115