Interval-parameter optimization problems on graphs

DOI10.1007/s10559-009-9093-5zbMath1181.90274OpenAlexW2024904135MaRDI QIDQ1040365

I. V. Kozin, V. A. Perepelitsa, N. K. Maksishkoa

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9093-5

zbMATH Keywords

computational complexitypolynomially solvable problemsstatistically efficient algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization
• On the significance of digits in interval notation
• Finding the set of alternatives in discrete multicriterion problems
• On cardinality of the set of alternatives in discrete many-criterion problems
• Rigorous solution of linear programming problems with uncertain data
• On the problems of linear programming with integral coefficients
• The robust spanning tree problem with interval data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item