Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry

DOI10.1134/S1990478915030072zbMath1349.90779MaRDI QIDQ3186829

Eh. N. Gordeev

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

stability radius; matroid; pseudo-Boolean polynomial; stability of the solution; geometric configuration

Mathematics Subject Classification ID

90C31: Sensitivity, stability, parametric optimization

Related Items

Stability Aspects of Multicriteria Integer Linear Programming Problems, Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem, Unnamed Item, Investment Boolean problem with savage risk criteria under uncertainty, On one type of stability for multiobjective integer linear programming problem with parameterized optimality, On the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of the stability of some integer programming algorithms with respect to the objective function
• Testing membership in matroid polyhedra
• A faster algorithm for computing the strength of a network
• Construction of optimal programmed paths for the motion of a robotic manipulator
• Stability analysis in optimization problems on matroids in the metric \(l_1\)
• A general approach to the study of the stability of solutions in discrete optimization problems
• On the stability of the Voronoi diagram.
• Some concepts of stability analysis in combinatorial optimization
• A rounding technique for the polymatroid membership problem
• A Fast Parametric Maximum Flow Algorithm and Applications
• Stability analysis of the minimum spanning tree problem