Opendata, web and dolomites

QIP SIGNED

Towards a Quantitative Theory of Integer Programming

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "QIP" data sheet

The following table provides information about the project.

Coordinator
STICHTING NEDERLANDSE WETENSCHAPPELIJK ONDERZOEK INSTITUTEN 

Organization address
address: WINTHONTLAAN 2
city: UTRECHT
postcode: 3526 KV
website: www.fom.nl

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Netherlands [NL]
 Total cost 1˙500˙000 €
 EC max contribution 1˙500˙000 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2018-STG
 Funding Scheme ERC-STG
 Starting year 2019
 Duration (year-month-day) from 2019-01-01   to  2023-12-31

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    STICHTING NEDERLANDSE WETENSCHAPPELIJK ONDERZOEK INSTITUTEN NL (UTRECHT) coordinator 1˙500˙000.00

Map

 Project objective

Integer programming (IP), i.e. linear optimization with integrality constraints on variables, is one of the most successful methods for solving large scale optimization problems in practice. While many of the base IP problems such as the traveling salesman problem (TSP) or satisfiability (SAT) are NP-Complete, IPs with tens of thousands of variables are routinely solved in just a few hours by current state of the art IP solvers.

The main goal of this proposal is to develop a quantitative theory capable of explaining when and how well different IP solver techniques will work on a wide range of instances. Here we will study many of the principal tools used to solve IPs including branch & bound, the simplex method, cutting planes and rounding heuristics. Our first direction of study will be to develop parametrized classes of instances, inspired by the structure of realistic models, on which branch & bound and the simplex method are provably efficient. The second research direction will be to develop alternatives to ad hoc rounding heuristics and cutting plane selection strategies with provable guarantees and provide their applications to important classes of IPs. Lastly, we will explore the power and limitations of IP techniques in the context of algorithm design by comparing them to powerful techniques in theoretical computer science and analyzing their worst-case performance for solving general integer programs. While the main thrust of this proposal is theoretical, it will be complimented by an experimental component performed in collaboration with well-known experts in computational IP, both to gain valuable insights on the structure of real-world instances and to validate the effectiveness newly suggested approaches. The proposed research is designed to make breakthroughs in our quantitative understanding of IP techniques, many of which have long resisted theoretical analysis.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "QIP" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "QIP" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

MIX2FIX (2019)

Hybrid, organic-inorganic chalcogenide optoelectronics

Read More  

IMPACCT (2019)

Improved Patient Care by Combinatorial Treatment

Read More  

Life-Inspired (2019)

Life-inspired complex molecular systems controlled by enzymatic reaction networks

Read More