Bin packing problem with order constraints.

dc.contributor.advisor	Hetland, Magnus Lie	nb_NO
dc.contributor.author	Lundanes, Petter Olsen	nb_NO
dc.date.accessioned	2014-12-19T13:42:16Z
dc.date.available	2014-12-19T13:42:16Z
dc.date.created	2014-12-07	nb_NO
dc.date.issued	2014	nb_NO
dc.identifier	769308	nb_NO
dc.identifier	ntnudaim:12009	nb_NO
dc.identifier.uri	http://hdl.handle.net/11250/253998
dc.description.abstract	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.	nb_NO
dc.language	eng	nb_NO
dc.publisher	Institutt for datateknikk og informasjonsvitenskap	nb_NO
dc.subject	ntnudaim:12009	no_NO
dc.subject	MTDT Datateknologi	no_NO
dc.subject	Komplekse datasystemer	no_NO
dc.title	Bin packing problem with order constraints.	nb_NO
dc.type	Master thesis	nb_NO
dc.source.pagenumber	63	nb_NO
dc.contributor.department	Norges teknisk-naturvitenskapelige universitet, Fakultet for informasjonsteknologi, matematikk og elektroteknikk, Institutt for datateknikk og informasjonsvitenskap	nb_NO