Exact algorithms for the quadratic linear ordering problem. (English)
INFORMS J. Comput. 22, No. 1, 168-177 (2010).
1
Building a quantum network: how to optimize security and expenses. (English)
J. Netw. Syst. Manag. 18, No. 3, 283-299 (2010).
2
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations. (English)
Math. Program. 121, No. 2 (A), 307-335 (2010).
3
Regularization methods for semidefinite programming (English)
SIAM Journal on Optimization 20, No. 1, 336-356 (2009).
4
A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. (English)
Fischetti, Matteo (ed.) et al., Integer programming and combinatorial optimization. 12th international IPCO conference, Ithaca, NY, USA, June 25‒27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72791-0/pbk). Lecture Notes in Computer Science 4513, 295-309 (2007).
5
A branch and bound algorithm for Max-cut based on combining semidefinite and polyhedral relaxations (English)
IPCO, 295-309 (2007).
6