Projects

Operations Research

A Low-rank Approach for Solving Sparse Max-Cut Problems
ADONET

A Low-rank Approach for Solving Sparse Max-Cut Problems

Description

We investigate a new low-rank algorithm for solving a semidefinite relaxation of the max-cut problem by exlpoiting the (potential) sparsity of the graphs. This is a joint project with Veronica Piccialli (Universita di Roma "La Sapienza") funded by the Forschungsrat der Alpen-Adria-Universität.

ADONET

Description

The OR group is part of the Marie-Curie Research Training Network which is a Consortium of 12 European Research Institutes on Discrete Optimization.

http://www.ads.tuwien.ac.at/adonet