Descripción del proyecto
La investigación estudia la optimización con restricciones y los problemas de satisfacción
Los problemas de optimización y satisfacción con restricciones (OSR) constituyen una amplia familia de problemas computacionales que suelen clasificarse como tratable (resolubles en tiempo polinómico) o intratables (NP-difícil). Sin embargo, algunos OSR se resisten a la clasificación, incluidos los problemas de la teoría de grafos, la combinatoria y la teoría de juegos matemática. El equipo del proyecto AUTAR, financiado por el Consejo Europeo de Investigación, pretende colmar esta laguna de conocimientos analizando los algoritmos candidatos que parecen resolver todas las instancias y no se limitan a describir instancias difíciles o hipótesis de dificultad. El método innovador de AUTAR se basará en un descubrimiento reciente de que dos métodos de áreas diferentes ―los juegos de guijarros indistinguibles de la lógica matemática y las jerarquías de relajaciones convexas de la programación matemática― coinciden en fuerza.
Objetivo
For a large family of computational problems collectively known as constrained optimization and satisfaction problems (CSPs), four decades of research in algorithms and computational complexity have led to a theory that tries to classify them as algorithmically tractable vs. intractable, i.e. polynomial-time solvable vs. NP-hard. However, there remains an important gap in our knowledge in that many CSPs of interest resist classification by this theory. Some such problems of practical relevance include fundamental partition problems in graph theory, isomorphism problems in combinatorics, and strategy-design problems in mathematical game theory. To tackle this gap in our knowledge, the research of the last decade has been driven either by finding hard instances for algorithms that solve tighter and tighter relaxations of the original problem, or by formulating new hardness-hypotheses that are stronger but admittedly less robust than NP-hardness.
The ultimate goal of this project is closing the gap between the partial progress that these approaches represent and the original classification project into tractable vs. intractable problems. Our thesis is that the field has reached a point where, in many cases of interest, the analysis of the current candidate algorithms that appear to solve all instances could suffice to classify the problem one way or the other, without the need for alternative hardness-hypotheses. The novelty in our approach is a program to develop our recent discovery that, in some cases of interest, two methods from different areas match in strength: indistinguishability pebble games from mathematical logic, and hierarchies of convex relaxations from mathematical programming. Thus, we aim at making significant advances in the status of important algorithmic problems by looking for a general theory that unifies and goes beyond the current understanding of its components.
Ámbito científico
Programa(s)
Régimen de financiación
ERC-COG - Consolidator GrantInstitución de acogida
08034 Barcelona
España