Cristian Dobre
Cristian Dobre has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Frank Vallentin
Universität zu Köln, Germany
2 shared publications - Leonhard Frerick
Department of Mathematics, Trier University, Trier, Germany
2 shared publications - Mirjam Dür
Department of Mathematics, University of Trier, Trier, Germany
2 shared publications - Juan Carlos Vera
Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands
1 shared publication
Latest Publications
- 9 January 2016
- Published by Springer Nature in Mathematical Programming
- Vol. 160 (1-2) , 65-83
A copositive formulation for the stability number of infinite graphs
- 9 January 2016
- Published by Springer Nature in Mathematical Programming
- Vol. 160 (1-2) , 65-83
A copositive formulation for the stability number of infinite graphs
- Open Access
A copositive formulation for the stability number of infinite graphs
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and show that the stability number of an infinite graph is the optimal solution of some infinite-dimensional copositive program. For this we develop a duality theory between the primal convex cone of copositive kernels and the dual convex cone of completely positive measures. We determine the extreme rays of the latter cone, and we illustrate this theory with the help of the kissing number problem.
Open AccessA copositive formulation for the stability number of infinite graphs
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and show that the stability number of an infinite graph is the optimal solution of some infinite-dimensional copositive program. For this we develop a duality theory between the primal convex cone of copositive kernels and the dual convex cone of completely positive measures. We determine the extreme rays of the latter cone, and we illustrate this theory with the help of the kissing number problem.
- 6 March 2015
- Published by Springer Nature in Mathematical Programming
- Vol. 151 (2) , 659-680
Exploiting symmetry in copositive programs via semidefinite hierarchies
- 6 March 2015
- Published by Springer Nature in Mathematical Programming
- Vol. 151 (2) , 659-680
Exploiting symmetry in copositive programs via semidefinite hierarchies