Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

ACUITY

Financiado

Cerrado

Algorithms for coping with uncertainty and intractability

The two biggest challenges in solving practical optimization problems are computational intractability, and the presence of uncertainty: most problems are either NP-hard, or have incomplete input data which makes an exact computat... ver más

31/12/2019

TU/e

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

TECHNISCHE UNIVERSITEIT EINDHOVEN No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2019-12-31 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

TU/e

0.00€ | Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

APEG Algorithmic Performance Guarantees Foundations and Applicat... 2M€ Cerrado

JDC2023-051006-I Optimization algorithms for machine learning and other high-... 72K€ Cerrado

PGC2018-095322-B-C21 OPTIMIZACION INTELIGENTE EN GRAFOS 63K€ Cerrado

TIN2011-24124 ALGORITMOS EVOLUTIVOS HIBRIDOS Y METAHEURISTICAS CONSTRUCTIV... 5K€ Cerrado

PCPABF Challenging Computational Infeasibility PCP and Boolean fun... 2M€ Cerrado

ALUNIF Algorithms and Lower Bounds A Unified Approach 1M€ Cerrado

Líder del proyecto

TECHNISCHE UNIVERSITEIT EINDHOVEN No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto The two biggest challenges in solving practical optimization problems are computational intractability, and the presence of uncertainty: most problems are either NP-hard, or have incomplete input data which makes an exact computation impossible. Recently, there has been a huge progress in our understanding of intractability, based on spectacular algorithmic and lower bound techniques. For several problems, especially those with only local constraints, we can design optimum approximation algorithms that are provably the best possible. However, typical optimization problems usually involve complex global constraints and are much less understood. The situation is even worse for coping with uncertainty. Most of the algorithms are based on ad-hoc techniques and there is no deeper understanding of what makes various problems easy or hard. This proposal describes several new directions, together with concrete intermediate goals, that will break important new ground in the theory of approximation and online algorithms. The particular directions we consider are (i) extend the primal dual method to systematically design online algorithms, (ii) build a structural theory of online problems based on work functions, (iii) develop new tools to use the power of strong convex relaxations and (iv) design new algorithmic approaches based on non-constructive proof techniques. The proposed research is at the cutting edge of algorithm design, and builds upon the recent success of the PI in resolving several longstanding questions in these areas. Any progress is likely to be a significant contribution to theoretical computer science and combinatorial optimization.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores