Reoptimization of the metric deadline TSP
From MaRDI portal
Publication:2266941
DOI10.1016/J.JDA.2009.04.001zbMATH Open1181.90229OpenAlexW1970492377MaRDI QIDQ2266941FDOQ2266941
Authors: Hans-Joachim Böckenhauer, Dennis Komm 
Publication date: 26 February 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.04.001
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- Some concepts of stability analysis in combinatorial optimization
- The parameterized approximability of TSP with deadlines
- Title not available (Why is that?)
- On the Hardness of Reoptimization
- Simple and fast reoptimizations for the Steiner tree problem
- Reoptimizing the traveling salesman problem
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Reoptimizing the 0-1 knapsack problem
- Reoptimization of Steiner Trees
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of Steiner trees: changing the terminal set
- On the Approximation Hardness of Some Generalizations of TSP
- Reoptimization of the Shortest Common Superstring Problem
- On the complexity of postoptimality analysis of \(0/1\) programs
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Title not available (Why is that?)
- Approximation hardness of deadline-TSP reoptimization
- Title not available (Why is that?)
Cited In (21)
- Heuristic reoptimization of time-extended multi-robot task allocation problems
- A survey on combinatorial optimization in dynamic environments
- Reoptimization of Minimum Latency problem
- New algorithms for Steiner tree reoptimization
- Deadline TSP
- TSP race: minimizing completion time in time-sensitive applications
- New algorithms for Steiner tree reoptimization
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
- Reoptimization in machine scheduling
- Robust reoptimization of Steiner trees
- Deadline TSP
- Reoptimization of NP-Hard Problems
- Approximation hardness of deadline-TSP reoptimization
- Reoptimization of minimum and maximum traveling salesman's tours
- Structural properties of hard metric TSP inputs (extended abstract)
- Reoptimization of the Metric Deadline TSP
- The parameterized approximability of TSP with deadlines
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Reoptimization of maximum weight induced hereditary subgraph problems
- Title not available (Why is that?)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
This page was built for publication: Reoptimization of the metric deadline TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266941)
