Skip to main content

Fundamental Problems at the Interface of Combinatorial Optimization with Integer Programming and Online Optimization

Project description

Integer programmes to answer open algorithmic questions

Recent projects combined with new ideas have opened the way to obtain advanced results in long-standing open problems in the fields of integer programming and online optimisation. The EU-funded ICOPT project proposes to take advantage and extend techniques from the domain of combinatorial optimisation to address some basic open algorithmic questions in these areas. The project will focus on several targets that present interesting combinatorial characteristics. These problems include questions related to integer programming with bounded subdeterminants, the expressive power of mixed-integer linear formulations, and questions on fundamental combinatorial online problems like the matroid secretary conjecture. Advances derived from the project are likely to significantly contribute to mathematical optimisation and theoretical computer science.

Call for proposal

ERC-2018-COG
See other projects for this call

Host institution

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Address
Raemistrasse 101
8092 Zuerich
Switzerland

See on map

Activity type
Higher or Secondary Education Establishments
EU contribution
€ 1 443 422

Beneficiaries (1)

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland
EU contribution
€ 1 443 422
Address
Raemistrasse 101
8092 Zuerich

See on map

Activity type
Higher or Secondary Education Establishments