2013 | OriginalPaper | Buchkapitel
A Complex-Networks View of Hard Combinatorial Search Spaces
verfasst von : Marco Tomassini, Fabio Daolio
Erschienen in: EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
According to worst-case complexity analysis, difficult combinatorial problems are those for which no polynomial-time algorithms are known (see, for instance, [15]). Thus, according to this point of view, large enough instances of these problems cannot be solved in reasonable time. The mathematical analysis is primarily based on decision problems, i.e. those that require a yes/no answer [7, 15], but the theory can readily be extended to optimization problems [16], roughly speaking, those in which we seek a solution with an associated minimum or maximum cost, which are the ones that will be dealt with here.