Bin packing problem with order constraints.
Master thesis
Permanent lenke
http://hdl.handle.net/11250/253998Utgivelsesdato
2014Metadata
Vis full innførselSamlinger
Sammendrag
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.