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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Alefeld and J. Hertzberger, Introduction to Interval Computations [Russian translation], Mir, Moscow (1987).
A. I. Demchenko, “Designing transport networks under uncertainty,” in: Proc. Seminar on Interval Mathematics, Saratov (1990), pp. 10–16.
G. L. Kozina and V. A. Perepelitsa, “Interval spanning trees problem: Solvability and computational complexity,” Interval Comput., 42–50 (1994).
V. A. Perepelitsa and G. L. Kozina, “Interval Discrete Models and Multiobjectivity: Complexity Estimates,” Interval Comput., 51–59 (1993).
H. Yaman, O. E. Karasan, and M. C. Pinar, “The robust spanning tree problem with interval data,” Oper. Res. Letters, 29, 31–40 (2001).
I. I. Eremin, Contradictory Models of Optimal Planning [in Russian], Nauka, Moscow (1998).
C. Jansson and S. M. Rump, “Rigorous solution of linear programming problems with uncertain data,” ZOR-Methods and Models of Oper. Res., 35, 87–111 (1991).
Maarten H. Van Emden, “On the significance of digits in interval notation,” Reliable Comput., No. 1, 45–58 (2004).
A. A. Vatolin, “On linear programming problems with interval coefficients,” Zh. Vychisl. Mat. Mat. Fiz., 24 (11), 1629–1637 (1984).
R. B. Kearfott and V. Kreinovich, “Applications of interval computations: An introduction,” in: R. B. Kearfott et al. (eds.), Applications of Interval Computations, Kluwer, Dordrecht (1996), pp. 1–22.
N. Christofides, Graph Theory: An Algorithmic Approach, Academ. Press, New York–London–San Francisco (1975).
K. Miettinen and M. M. Makela, “On cone characterizations of weak, proper, and Pareto optimality in multiobjective optimization,” Math. Meth. Oper. Res., 53, 233–245 (2001).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Bell Lab., San Francisco (1979).
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Courier Dover Publ. (1998).
V. A. Emelichev and V. A. Perepelitsa, “On cardinality of the set of alternatives in discrete many-criteria problems,” Discrete Mathemat. and Appl., 2, No. 5, 461–471 (1992).
I. V. Sergienko, Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).
V. A. Emelichev and M. K. Kravtsov, “On the unsolvability of vector discrete optimization problems on systems of subsets in the class of algorithms involving linear convolution of criteria,” Dokl. Ros. Akad. Nauk, 49, No. 1, 6–9 (1994).
I. V. Sergienko and V. A. Perepelitsa, “Finding the set of alternatives in discrete multicriterion problems,” Cybernetics, No. 5, 673–684 (1987).
V. F. Kolchin, Random Graphs [in Russian], Fizmatlit, Moscow (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 3–14, March–April 2009.
Rights and permissions
About this article
Cite this article
Perepelitsa, V.A., Kozin, I.V. & Maksishkoa, a.N.K. Interval-parameter optimization problems on graphs. Cybern Syst Anal 45, 167–176 (2009). https://doi.org/10.1007/s10559-009-9093-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-009-9093-5