Adaptive stability in combinatorial optimization problems
From MaRDI portal
Publication:2516596
Recommendations
Cites work
- scientific article; zbMATH DE number 3139099 (Why is no real title available?)
- scientific article; zbMATH DE number 3687221 (Why is no real title available?)
- scientific article; zbMATH DE number 4127005 (Why is no real title available?)
- scientific article; zbMATH DE number 892018 (Why is no real title available?)
- scientific article; zbMATH DE number 5691661 (Why is no real title available?)
- scientific article; zbMATH DE number 969937 (Why is no real title available?)
- scientific article; zbMATH DE number 3062713 (Why is no real title available?)
- A general approach to the study of the stability of solutions in discrete optimization problems
- Criterion of the stability of optimal route in the travelling salesman problem in case of a single vertex addition
- Dynamic programming method in bottleneck tasks distribution problem with equal agents
- On the stability of some integer programming algorithms
- Stability in the combinatorial vector optimization problems
Cited in
(5)- The choice of algorithms for solving a multi-agent routing problem based on solving related problems
- scientific article; zbMATH DE number 4127013 (Why is no real title available?)
- On the tradeoff between stability and fit
- Adaptive algorithm structure: impacts on stability and performance
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
This page was built for publication: Adaptive stability in combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2516596)