ERC Starting Grant · 2017
Scaling Methods for Discrete and Continuous Optimization
One of the most important open questions in optimization is to find a strongly polynomial algorithm for linear programming. The proposed project aims to tackle this problem by combining novel techniques from two different domains: discrete optimization and continuous optimization. We expect to contribute to exciting recent developments on the interface of these two fields. We use and develop new variants of the classical scaling technique. From the discrete optimization side, recent work of the PI on generalized flows extends classical network flow theory and opens up new domains for strongly polynomial computability beyond integer constraint matrices. We will apply this novel scaling…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.
← All labs at London School of Economics and Political Science (LSE)