|
||
GOM |
DI |
Aykut ÖZSOY
|
![]() |
|
![]() |
||||||||||||||||||
contact |
|
|||||||||||||||||
![]() |
||||||||||||||||||
short CV |
|
![]() |
||
| areas of interest | operations
research combinatorial
optimization mixed
integer programming |
![]() |
||
| publications | ![]() |
Size constrained graph partitioning polytope. Part I : Dimension and trivial facets Part II : Non-trivial facets, Aykut Özsoy, Martine Labbé, Technical Report, G.O.M., March 2007. |
![]() |
F. Aykut Özsoy, Mustafa Ç. Pınar, An exact algorithm for the capacitated vertex p-center problem, Computers and Operations Research, 33 (5), 1420-1436, May 2006. | |
![]() |
Integer Programming Formulations for Three Scalability Problems in Internet Protocol Networks (D.E.A. thesis), Aykut Özsoy, U.L.B., Département d'Informatique, Brussels, Belgium, June 2005. | |
![]() |
Algorithms for some discrete location problems (M. Sc. Thesis), Aykut Özsoy, Bilkent University, Department of Industrial Engineering, Ankara, Türkiye, September 2003. | |
![]() |
An Efficient Exact Algorithm for the Vertex p-Center Problem and Computational Experiments for Different Set Covering Subproblems, Taylan İlhan, Aykut Özsoy, Mustafa Ç. Pınar, Technical Report, Available at Optimization Online, November 2002. |
![]() |
| ( by Aykut ÖZSOY ) |