Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
From MaRDI portal
Publication:3009332
DOI10.1007/978-3-642-20000-7_2zbMath1331.90060OpenAlexW84056012MaRDI QIDQ3009332
Juraj Hromkovič, Andreas Sprock, Hans-Joachim Böckenhauer
Publication date: 24 June 2011
Published in: Computation, Cooperation, and Life (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/156331
Related Items (5)
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Unnamed Item ⋮ Reoptimization in machine scheduling ⋮ On one approach to TSP structural stability
Cites Work
- Unnamed Item
- Unnamed Item
- Reoptimizing the 0-1 knapsack problem
- Reoptimization of the shortest common superstring problem
- Reoptimization of Steiner trees: changing the terminal set
- The Steiner problem with edge lengths 1 and 2
- On the complexity of postoptimality analysis of \(0/1\) programs
- Reoptimization of Steiner Trees
- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
- Reoptimization of the Metric Deadline TSP
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of the Shortest Common Superstring Problem
- P-Complete Approximation Problems
- Some Examples of Difficult Traveling Salesman Problems
- Reoptimizing the traveling salesman problem
- The Traveling Salesman Problem with Distances One and Two
- On the Hardness of Reoptimization
- The steiner problem in graphs
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Scheduling with forbidden sets
This page was built for publication: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
