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
See other projects for this call