Graduate Program in Industrial Engineering.Ulusoy, Gündüz.Ünal, Ali Tamer.2023-03-162023-03-161988.IE 1988 Un11https://digitalarchive.library.bogazici.edu.tr/handle/123456789/13472Bin 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.30 cm.Combinatorial packing and covering.Network analysis (Planning)Linear programming.Algorithms.vii, 44 leaves;