Interval-parameter optimization problems on graphs

Authors:
V. A. Perepelitsa;I. V. Kozin;And N. Maksishkoa
Affiliations:
Zaporozhye National University, Zaporozhye, Ukraine;Zaporozhye National University, Zaporozhye, Ukraine;Zaporozhye National University, Zaporozhye, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2009

Citing 6
Cited 0

On the problems of linear programming with integral coefficients

USSR Computational Mathematics and Mathematical Physics
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Random graphs

Random graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
The robust spanning tree problem with interval data

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.