A note on the traveling salesman reoptimization problem under vertex insertion

DOI10.1016/j.ipl.2014.11.003zbMath1318.90061OpenAlexW1964618519MaRDI QIDQ483055

Jérôme Monnot

Publication date: 15 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.11.003

zbMATH Keywords

TSPapproximation algorithmsreoptimization under vertex insertion

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Robust reoptimization of Steiner trees ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Unnamed Item ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reoptimization of maximum weight induced hereditary subgraph problems
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• The saga of minimum spanning trees
• Reoptimizing the rural postman problem
• Reoptimizing the 0-1 knapsack problem
• Reoptimization of the shortest common superstring problem
• Fast reoptimization for the minimum spanning tree problem
• Approximation hardness of deadline-TSP reoptimization
• Reoptimization of minimum and maximum traveling salesman's tours
• The traveling salesman problem and its variations
• Reoptimization in machine scheduling
• New Inapproximability Bounds for TSP
• Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
• A Theory and Algorithms for Combinatorial Reoptimization
• A survey on combinatorial optimization in dynamic environments
• New Advances in Reoptimizing the Minimum Steiner Tree Problem
• Reoptimization of Steiner Trees
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
• Reoptimizing the traveling salesman problem
• Approximating the Minimum Spanning Tree Weight in Sublinear Time
• On the Hardness of Reoptimization
• Scheduling with forbidden sets
• Reoptimization of NP-Hard Problems

This page was built for publication: A note on the traveling salesman reoptimization problem under vertex insertion