A note on the traveling salesman reoptimization problem under vertex insertion
type: Item
instance of: scholarly article
title: A note on the traveling salesman reoptimization problem under vertex insertion
zbMATH Open document ID: 1318.90061
published in: Information Processing Letters
publication date: 2014-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6380678
zbMATH Keywords: approximation algorithms
zbMATH Keywords: reoptimization under vertex insertion
zbMATH Keywords: TSP
author: Jérôme Monnot
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.11.003
OpenAlex ID: W1964618519
cites work: Reoptimizing the traveling salesman problem
cites work: Reoptimizing the 0-1 knapsack problem
cites work: Reoptimizing the rural postman problem
cites work: Q3396498
cites work: Reoptimization of minimum and maximum traveling salesman's tours
cites work: Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
cites work: Reoptimization of Steiner Trees
cites work: Reoptimization of the shortest common superstring problem
cites work: Reoptimization of Weighted Graph and Covering Problems
cites work: New Advances in Reoptimizing the Minimum Steiner Tree Problem
cites work: Q3079180
cites work: Steiner tree reoptimization in graphs with sharpened triangle inequality
cites work: On the Hardness of Reoptimization
cites work: Approximation hardness of deadline-TSP reoptimization
cites work: Reoptimization in machine scheduling
cites work: Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
cites work: Reoptimization of maximum weight induced hereditary subgraph problems
cites work: Fast reoptimization for the minimum spanning tree problem
cites work: A survey on combinatorial optimization in dynamic environments
cites work: Approximating the Minimum Spanning Tree Weight in Sublinear Time
cites work: Q3651735
cites work: Simple and fast reoptimizations for the Steiner tree problem
cites work: Q4198056
cites work: The traveling salesman problem and its variations
cites work: Q4365133
cites work: New Inapproximability Bounds for TSP
cites work: Q5187226
cites work: The saga of minimum spanning trees
cites work: Scheduling with forbidden sets
cites work: A Theory and Algorithms for Combinatorial Reoptimization
cites work: Reoptimization of NP-Hard Problems
DOI: 10.1016/J.IPL.2014.11.003
description: scientific article; zbMATH DE number 6380678