Adaptive stability in combinatorial optimization problems

DOI10.1134/S0081543815020091zbMATH Open1317.90257MaRDI QIDQ2516596FDOQ2516596

E. E. Ivanko

Publication date: 3 August 2015

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Recommendations

• Publication:4206576
• scientific article
• Some concepts of stability analysis in combinatorial optimization
• scientific article; zbMATH DE number 3854815
• scientific article; zbMATH DE number 3883966

zbMATH Keywords

stabilitycombinatorial optimization problemadaptation of solutionsdisturbance of the initial data set

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the stability of some integer programming algorithms
• Title not available (Why is that?)
• Stability in the combinatorial vector optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Dynamic programming method in bottleneck tasks distribution problem with equal agents
• Title not available (Why is that?)

Cited In (4)

• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
• The choice of algorithms for solving a multi-agent routing problem based on solving related problems
• Title not available (Why is that?)
• Adaptive algorithm structure: impacts on stability and performance

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)