New algorithms for the bin packing problem

dc.contributor	Graduate Program in Industrial Engineering.
dc.contributor.advisor	Ulusoy, Gündüz.
dc.contributor.author	Ünal, Ali Tamer.
dc.date.accessioned	2023-03-16T10:30:32Z
dc.date.available	2023-03-16T10:30:32Z
dc.date.issued	1988.
dc.description.abstract	Bin Packing is a well-known NP-complete problem which has many real-life applications. In this study, an extensive literature survey is followed by a number of new heuristic and optimal algorithms developed using a new general procedure called "Similar Tree Search Algorithm" to solve zero-one integer prograrrming problems. Besides, a new special case of the bin packing problem, smooth packing, is defined and algorithmS to solve this new problem are generated and tested.
dc.format.extent	30 cm.
dc.format.pages	vii, 44 leaves;
dc.identifier.other	IE 1988 Un11
dc.identifier.uri	https://hdl.handle.net/20.500.14908/13472
dc.publisher	Thesis (M.S.)- Bogazici University. Institute for Graduate Studies in Science and Engineering, 1988.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Combinatorial packing and covering.
dc.subject.lcsh	Network analysis (Planning)
dc.subject.lcsh	Linear programming.
dc.subject.lcsh	Algorithms.
dc.title	New algorithms for the bin packing problem

Files

Now showing 1 - 1 of 1