Bin packing with directed stackability conflicts

The Bin Packing problem is a well-known and highly investigated problem in the computer science: we have n items given with their sizes, and we want to assign them to unit capacity bins such, that we use the minimum number of bins.

Bibliographic Details
Main Author:	Bódis Attila
Format:	Article
Language:	English
Published:	Sciendo 2015-06-01
Series:	Acta Universitatis Sapientiae: Informatica
Subjects:	f.2.2 68r05 bin packing problem conflicts directed conflicts hanoi conflicts unit size items dynamic programming
Online Access:	https://doi.org/10.1515/ausi-2015-0011

id	doaj-fa3e9588bf5b4428a338e3cb90aa566b
record_format	Article
spelling	doaj-fa3e9588bf5b4428a338e3cb90aa566b2021-09-06T19:40:19ZengSciendoActa Universitatis Sapientiae: Informatica2066-77602015-06-0171315710.1515/ausi-2015-0011Bin packing with directed stackability conflictsBódis Attila0University of SzegedThe Bin Packing problem is a well-known and highly investigated problem in the computer science: we have n items given with their sizes, and we want to assign them to unit capacity bins such, that we use the minimum number of bins.https://doi.org/10.1515/ausi-2015-0011f.2.268r05bin packing problemconflictsdirected conflictshanoi conflictsunit size itemsdynamic programming
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Bódis Attila
spellingShingle	Bódis Attila Bin packing with directed stackability conflicts Acta Universitatis Sapientiae: Informatica f.2.2 68r05 bin packing problem conflicts directed conflicts hanoi conflicts unit size items dynamic programming
author_facet	Bódis Attila
author_sort	Bódis Attila
title	Bin packing with directed stackability conflicts
title_short	Bin packing with directed stackability conflicts
title_full	Bin packing with directed stackability conflicts
title_fullStr	Bin packing with directed stackability conflicts
title_full_unstemmed	Bin packing with directed stackability conflicts
title_sort	bin packing with directed stackability conflicts
publisher	Sciendo
series	Acta Universitatis Sapientiae: Informatica
issn	2066-7760
publishDate	2015-06-01
description	The Bin Packing problem is a well-known and highly investigated problem in the computer science: we have n items given with their sizes, and we want to assign them to unit capacity bins such, that we use the minimum number of bins.
topic	f.2.2 68r05 bin packing problem conflicts directed conflicts hanoi conflicts unit size items dynamic programming
url	https://doi.org/10.1515/ausi-2015-0011
work_keys_str_mv	AT bodisattila binpackingwithdirectedstackabilityconflicts
_version_	1717768860002680832

Bin packing with directed stackability conflicts

Similar Items