An Algebraic Theory of Complexity for Discrete Optimization

Discrete optimization problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimized can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on computing Ročník 42; číslo 5; s. 1915 - 1939
Hlavní autori: Cohen, David A., Cooper, Martin C., Creed, Páidí, Jeavons, Peter G., Živný, Stanislav
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Predmet:
Algebra
Applied mathematics
Artificial Intelligence
Boolean
Cloning
Computation and Language
Computer Science
Integer programming
International conferences
Language
Logic in Computer Science
Machine Learning
Optimization
Polymorphism
Scholarships & fellowships
Values
Weighted Polymorphisms
Galois Connection
Valued Constraint Satisfaction Problems
Constraint Optimization
Discrete Optimization
Weighted Clones
ISSN:0097-5397, 1095-7111
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Discrete optimization problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimized can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete optimization problem is determined by certain algebraic properties of the objective function, which we call weighted polymorphisms. We define a Galois connection between sets of rational-valued functions and sets of weighted polymorphisms and show how the closed sets of this Galois connection can be characterized. These results provide a new approach to studying the complexity of discrete optimization. We use this approach to identify certain maximal tractable subproblems of the general problem and hence derive a complete classification of complexity for the Boolean case. [PUBLICATION ABSTRACT]
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/130906398