Reusing Optimal TSP Solutions for Locally Modified Input Instances
暂无分享,去创建一个
Guido Proietti | Juraj Hromkovic | Hans-Joachim Böckenhauer | Peter Widmayer | Joachim Kneis | Joachim Kupke | Luca Forlizzi
[1] Juraj Hromkovic,et al. The Parameterized Approximability of TSP with Deadlines , 2007, Theory of Computing Systems.
[2] Harvey J. Greenberg,et al. An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization , 1997 .
[3] Juraj Hromkovic,et al. Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics , 2001 .
[4] Samir Khuller,et al. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem , 1998, FSTTCS.
[5] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[6] Jean-François Cordeau,et al. VRP with Time Windows , 1999, The Vehicle Routing Problem.
[7] Hans-Joachim Böckenhauer,et al. Improved lower bounds on the approximability of the Traveling Salesman Problem , 2000, RAIRO Theor. Informatics Appl..
[8] Juraj Hromkovic. Stability of Approximation Algorithms for Hard Optimization Problems , 1999, SOFSEM.
[9] Guido Proietti,et al. On the Stability of Approximation for Hamiltonian Path Problems , 2006, Algorithmic Oper. Res..
[10] A. J.,et al. Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .
[11] SotskoP,et al. Some concepts of stability analysis in combinatorial optimization , 2003 .
[12] Juraj Hromkovic,et al. Algorithmics for Hard Problems , 2004, Texts in Theoretical Computer Science. An EATCS Series.
[13] Juraj Hromkovic,et al. On the Approximation Hardness of Some Generalizations of TSP , 2006, SWAT.
[14] Kenneth Steiglitz,et al. Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..
[15] Marek Libura,et al. Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems , 1991, Discret. Appl. Math..
[16] Gerard Sierksma,et al. Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions , 1998, Discret. Appl. Math..
[17] Hans-Jürgen Bandelt,et al. Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities , 1995, SIAM J. Discret. Math..
[18] Juraj Hromkovic,et al. Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem , 2002, Theor. Comput. Sci..
[19] Michael A. Bender,et al. Performance guarantees for the TSP with a parameterized triangle inequality , 1999, Inf. Process. Lett..
[20] Albert P. M. Wagelmans,et al. On the Complexity of Postoptimality Analysis of 0/1 Programs , 1999, Discret. Appl. Math..
[21] Thomas Andreae,et al. On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality , 2001, Networks.
[22] Michael A. Bender,et al. Performance guarantees for the TSP with a parameterized triangle inequality , 2000, Inf. Process. Lett..
[23] Juraj Hromkovic,et al. Approximation algorithms for the TSP with sharpened triangle inequality , 2000, Inf. Process. Lett..