Change search
ReferencesLink to record
Permanent link

Direct link
Bin packing problem with order constraints.
Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, Department of Computer and Information Science.
2014 (English)MasteroppgaveStudent thesis
Abstract [en]

This paper presents an algorithm to solve a variant of the bin packing problem with additional constraints on the order of items. The performance of this algorithm is tested, both for optimal solutions and approximations given by early termination, and is found to be limited for optimal solutions, but fairly efficient for decent approximations.

Place, publisher, year, edition, pages
Institutt for datateknikk og informasjonsvitenskap , 2014. , 63 p.
Keyword [no]
ntnudaim:12009, MTDT Datateknologi, Komplekse datasystemer
URN: urn:nbn:no:ntnu:diva-27334Local ID: ntnudaim:12009OAI: diva2:769308
Available from: 2014-12-07 Created: 2014-12-07

Open Access in DiVA

fulltext(760 kB)448 downloads
File information
File name FULLTEXT01.pdfFile size 760 kBChecksum SHA-512
Type fulltextMimetype application/pdf
cover(184 kB)0 downloads
File information
File name COVER01.pdfFile size 184 kBChecksum SHA-512
Type coverMimetype application/pdf
attachment(3 kB)4 downloads
File information
File name ATTACHMENT01.zipFile size 3 kBChecksum SHA-512
Type attachmentMimetype application/zip

By organisation
Department of Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 448 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 17 hits
ReferencesLink to record
Permanent link

Direct link