Some forms of stability of a combinatorial problem of lexicographic optimization
From MaRDI portal
Publication:1589845
zbMATH Open0965.90040MaRDI QIDQ1589845FDOQ1589845
Authors: R. A. Berdysheva, V. A. Emelichev 
Publication date: 5 August 2001
Published in: Russian Mathematics (Search for Journal in Brave)
Recommendations
- The stability of lexicographic optimization problems
- scientific article; zbMATH DE number 6260307
- scientific article; zbMATH DE number 3968297
- scientific article; zbMATH DE number 4100959
- Stability of linear path problems in lexicographic optimization
- scientific article
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- Stability criterion for a lexicographic Boolean optimization problem
- On stability of some lexicographic multicriteria Boolean problem
- Some concepts of stability analysis in combinatorial optimization
Cited In (11)
- Title not available (Why is that?)
- Stability criterion for a lexicographic Boolean optimization problem
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- Title not available (Why is that?)
- On the strong stability of a vector trajectorial problem of the lexicographic optimization
- The stability of lexicographic optimization problems
- On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stability and regularization of the lexicographic vector problem of quadratic discrete programming
This page was built for publication: Some forms of stability of a combinatorial problem of lexicographic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589845)
