Doğan, Saliha Ferda2019-08-092019-08-092019-072019-072019-07-23http://hdl.handle.net/11693/52327Cataloged from PDF version of article.Thesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2019.Includes bibliographical references (leaves 47-49).We propose an exact algorithm to find all nondominated points of biobjective integer programming problems, which arise in various applications of operations research. The algorithm is based on dividing objective space into regions (boxes) and searching them by solving Pascoletti-Serafini scalarizations with fixed direction vector. We develop variants of the algorithm, where the choice of the scalarization model parameters differ; and demonstrate their performance through computational experiments both as exact algorithms and as solution approaches under time restriction. The results of our experiments show the satisfactory behaviour of our algorithm, especially with respect to the number of mixed integer programming problems solved compared to an existing approach. The experiments also demonstrate that different variants have advantages in different aspects: while some variants are quicker in finding the whole set of nondominated solutions, other variants return good-quality solutions in terms of representativeness when run under time restriction.xii, 55 leaves : charts (some color) ; 30 cm.Englishinfo:eu-repo/semantics/openAccessBiobjective integer programmingPascoletti-Serafini scalarizationAlgorithmsThesisB149393