Advisors
Now showing items 1-6 of 6
-
Algorithms for on-line vertex enumeration problem
(Bilkent University, 2017-09)Vertex enumeration problem is to enumerate all vertices of a polyhedron P which is given by intersection of finitely many halfspaces. It is a basis for many algorithms designed to solve problems from various application ... -
An exact algorithm for biobjective integer programming problems
(Bilkent University, 2019-07)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 ... -
Exact solution algorithms for biobjective mixed integer programming problems
(Bilkent University, 2020-08)In this thesis, objective space based exact solution algorithms for biobjective mixed integer programming problems are proposed. The algorithms solve scalarization models in order to explore predetermined regions of the ... -
A new geometric duality and approximation algorithms for convex vector optimization problems
(Bilkent University, 2021-07)In the literature, there are different algorithms for solving convex vector optimization problems, in the sense of approximating the set of all minimal points in the objective space. One of the main approaches is to provide ... -
Norm minimization-based convex vector optimization algorithms
(Bilkent University, 2022-08)This thesis is concerned with convex vector optimization problems (CVOP). We propose an outer approximation algorithm (Algorithm 1) for solving CVOPs. In each iteration, the algorithm solves a norm-minimizing scalarization ... -
Outer approximation algorithms for convex vector optimization problems
(Bilkent University, 2021-07)There are different outer approximation algorithms in the literature that are de-signed to solve convex vector optimization problems in the sense that they approx-imate the upper image using polyhedral sets. At each iteration, ...
