A general approach to the study of the stability of solutions in discrete optimization problems
From MaRDI portal
Publication:1418436
zbMATH Open1027.90526MaRDI QIDQ1418436FDOQ1418436
Authors: Eh. N. Gordeev, V. K. Leont'ev 
Publication date: 12 January 2004
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Cited In (13)
- Stability Analysis for Pricing
- Note on a vertex stability radius in the shortest path problem
- Title not available (Why is that?)
- Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry
- Stability conditions for the vector path problem in lexicographic discrete optimization
- Adaptive stability in combinatorial optimization problems
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- Stability analysis in discrete optimization involving generalized addition operations
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria
- Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets
- Stability of solutions in problems of computational geometry
- On one approach to TSP structural stability
This page was built for publication: A general approach to the study of the stability of solutions in discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1418436)
