Skip to main content

Technology Transfer between Integer Programming and Efficient Algorithms

Project description

Advanced algorithms to optimally resolve knapsack-type problems

The knapsack problem belongs to a class of mathematical problems famous for pushing the limits of computing. The EU-funded TIPEA project aims to resolve challenging integer programming problems related to a list of knapsack-type problems including the subset sum and the partition of numbers. Combining efficient algorithmic tools and studies on structural theory and conditional lower bounds will allow researchers to derive the best possible algorithms for these widespread computing problems. The new algorithms could also prove useful in the study of polynomial-time problems.

Call for proposal

ERC-2019-STG
See other projects for this call

Host institution

UNIVERSITAT DES SAARLANDES
Address
Campus
66123 Saarbrucken
Germany
Activity type
Higher or Secondary Education Establishments
EU contribution
€ 1 499 375

Beneficiaries (1)

UNIVERSITAT DES SAARLANDES
Germany
EU contribution
€ 1 499 375
Address
Campus
66123 Saarbrucken
Activity type
Higher or Secondary Education Establishments