Stability radius of a lexicographic optimum of a vector problem of Boolean programming
From MaRDI portal
Publication:2577237
DOI10.1007/s10559-005-0054-3zbMath1076.90033OpenAlexW2024917463MaRDI QIDQ2577237
Kirill G. Kuzmin, Vladimir A. Emelichev
Publication date: 19 December 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-005-0054-3
Related Items (1)
Cites Work
- Some concepts of stability analysis in combinatorial optimization
- Integer programming problems with inexact data: Exact and approximate solutions
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.
- Stability of discrete optimization problems
- Stability of discrete vector problems with the parametric principle of optimality
- Stability and Regularization of Vector Problems of Integer Linear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stability radius of a lexicographic optimum of a vector problem of Boolean programming