Interval-parameter optimization problems on graphs

Interval-parameter optimization problems on graphs

Well-known optimization problems on graphs are considered under uncertainty when parameter domains are specified in the form of intervals. Exponential estimates of computational complexity of problems being studied and also problems that are polynomial in the classical formulation are substantiated....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2009-03, Vol.45 (2), p.167-176
Hauptverfasser: Perepelitsa, V. A., Kozin, I. V., Maksishkoa, and N. K.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Artificial Intelligence
Computational efficiency
Control
Cybernetics
Estimates
Graphs
Hierarchies
Linear programming
Mathematical models
Mathematics
Mathematics and Statistics
Optimization
Pareto optimum
Polynomials
Processor Architectures
Software Engineering/Programming and Operating Systems
Studies
Systems Theory
Uncertainty
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Well-known optimization problems on graphs are considered under uncertainty when parameter domains are specified in the form of intervals. Exponential estimates of computational complexity of problems being studied and also problems that are polynomial in the classical formulation are substantiated. Polynomially solvable subclasses are found, and sufficient conditions of statistical efficiency of a proposed approximate algorithm are constructively substantiated.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-009-9093-5