Now showing items 1-2 of 2

    • Algorithms for on-line vertex enumeration problem 

      Kaya, İrfan Caner (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 

      Doğan, Saliha Ferda (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 ...