Stability of a routing optimization algorithm

DOI10.1007/BF02667202zbMATH Open0916.90257MaRDI QIDQ1280902FDOQ1280902

L. T. Buslaeva

Publication date: 28 April 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

stability of solutionstraveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• The stability of the approximate Boolean minimization of a linear form
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Criterion of the stability of optimal route in the travelling salesman problem in case of a single vertex addition 👍 👎
• On one approach to TSP structural stability 👍 👎
• Title not available (Why is that?) 👍 👎
• On the Complexity of the Metric TSP under Stability Considerations 👍 👎
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. 👍 👎

This page was built for publication: Stability of a routing optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280902)