Stability conditions for the vector path problem in lexicographic discrete optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3687221 (Why is no real title available?)
- scientific article; zbMATH DE number 1179591 (Why is no real title available?)
- scientific article; zbMATH DE number 892018 (Why is no real title available?)
- A general approach to the study of the stability of solutions in discrete optimization problems
- On the quasistability of trajectory problems of vector optimization
- Stability in vector optimization path problems
- Stability of linear path problems in lexicographic optimization
- Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
Cited in
(8)- Stability criterion for a lexicographic Boolean optimization problem
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- Stability in vector optimization path problems
- Boolean problem of sequential minimization of moduli of linear functions and stability theorems
- Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
- The stability of lexicographic optimization problems
- scientific article; zbMATH DE number 6260307 (Why is no real title available?)
- Stability and regularization of the lexicographic vector problem of quadratic discrete programming
This page was built for publication: Stability conditions for the vector path problem in lexicographic discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288669)