Advisors
Now showing items 1-10 of 10
-
Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods
(Bilkent University, 1998)Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ... -
Efficient algorithms for the minimum cost perfect matching problem on general graphs
(Bilkent University, 1993)The minimum cost perfect matching problem is one of the rare combinatorial optimization problems for which polynomial time algorithms exist. Matching algorithms find applications in Postman Problem, Planar Multicommodity ... -
Investigation of Si1-xGex alloy formation by using STM
(Bilkent University, 1994) -
A New approach in the maximum flow problem
(Bilkent University, 1989)In this study, we tried to approach the maximum flow problem from a different point of view. This effort has led us to the development of a new maximum flow algorithm. The algorithm is based on the idea that when ... -
A polyhedral approach to delivery man problem
(Bilkent University, 1992)In this thesis we discuss some polyhedral approaches to the Delivery Man Problem(DMP),which is a special case of the Traveling .Scvlesman Problem(TSP). First, we look at two formulations of the problem and describe a ... -
A polyhedral approach to quadratic assignment problem
(Bilkent University, 1994)In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems ... -
Polyhedral Approaches to Hypergraph Partitioning and Cell Formation
(Bilkent University, 1994)Hypergraphs are generalizations of graphs in the sense that each hyperedge can connect more than two vertices. Hypergraphs are used to describe manufacturing environments and electrical circuits. Hypergraph partitioning ... -
Simplex Tableau based approximate projection in Karmarkar's algorithm
(Bilkent University, 1990)In this thesis, our main concern is to develop a new implementation of Karmarkar’s LP Algorithm and compare it with the standard version. In the implementation, the “Simplex Tableau” information is used in the basic step ... -
A successive algorithm for the Chinese Postman Problem
(Bilkent University, 1991)The Chinese Postman Problem being one of the well known problems in combinatorial optimization has many applications in real life problems such as mail delivery, road maintenance and bus scheduling. In this thesis work, ... -
Two new algorithms for the linear assignment problem
(Bilkent University, 1990)The linear assignment problem (AP) being among the first linear programming problems to be studied extensively,, is a fundamental problem in combinatorial optimization and network flow theory. AP arises in numerous ...
