Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
From MaRDI portal
(Redirected from Publication:5757891)
Recommendations
Cited in
(38)- Approximation hardness of deadline-TSP reoptimization
- Reoptimization of minimum and maximum traveling salesman's tours
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- Relaxed tours and path ejections for the traveling salesman problem
- Reoptimization of parameterized problems
- Reoptimization of set covering problems
- On one approach to TSP structural stability
- Reoptimization of the metric deadline TSP
- Reoptimization of Minimum Latency problem
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Reoptimization in machine scheduling
- New reoptimization techniques applied to Steiner tree problem
- A survey on combinatorial optimization in dynamic environments
- On minimum reload cost paths, tours, and flows
- Knowing all optimal solutions does not help for TSP reoptimization
- Structural properties of hard metric TSP inputs (extended abstract)
- Some Inverse Traveling Salesman Problems
- Reoptimization of the Metric Deadline TSP
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of constraint satisfaction problems with approximation resistant predicates
- Reoptimization of maximum weight induced hereditary subgraph problems
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- Reoptimizing the traveling salesman problem
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
- A note on the traveling salesman reoptimization problem under vertex insertion
- Finding Optimal Solutions With Neighborly Help.
- On the Hardness of Reoptimization
- Reoptimizing the 0-1 knapsack problem
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
- Reoptimization of NP-Hard Problems
- Reoptimization of the shortest common superstring problem
- Finding optimal solutions with neighborly help
- Reoptimization of Steiner trees: changing the terminal set
- Fast reoptimization for the minimum spanning tree problem
This page was built for publication: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757891)
