On the Hardness of Reoptimization with Multiple Given Solutions
暂无分享,去创建一个
Juraj Hromkovic | Hans-Joachim Böckenhauer | Andreas Sprock | J. Hromkovic | Hans-Joachim Böckenhauer | A. Sprock
[1] Juraj Hromkovic,et al. On the Hardness of Reoptimization , 2008, SOFSEM.
[2] Luca Bertazzi,et al. Reoptimizing the traveling salesman problem , 2003, Networks.
[3] Juraj Hromkovic,et al. Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics , 2001 .
[4] Juraj Hromkovic,et al. Reoptimization of Steiner trees: Changing the terminal set , 2009, Theor. Comput. Sci..
[5] Dennis Komm,et al. Reoptimization of the metric deadline TSP , 2008, J. Discrete Algorithms.
[6] Guido Proietti,et al. On the Approximability of TSP on Local Modifications of Optimally Solved Instances , 2007, Algorithmic Oper. Res..
[7] Vangelis Th. Paschos,et al. Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.
[8] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[9] Guido Proietti,et al. Reusing Optimal TSP Solutions for Locally Modified Input Instances , 2006, IFIP TCS.
[10] Vangelis Th. Paschos,et al. Simple and Fast Reoptimizations for the Steiner Tree Problem , 2009, Algorithmic Oper. Res..
[11] Juraj Hromkovic,et al. Algorithmics for Hard Problems , 2002, Texts in Theoretical Computer Science An EATCS Series.
[12] Luca Bertazzi,et al. Reoptimizing the 0-1 knapsack problem , 2010, Discret. Appl. Math..
[13] Juraj Hromkovič,et al. Knowing all optimal solutions does not help for TSP reoptimization , 2011 .
[14] A. Cayley. A theorem on trees , 2009 .
[15] G. Ausiello,et al. Complexity and Approximation in Reoptimization , 2008 .
[16] Juraj Hromkovic,et al. Steiner tree reoptimization in graphs with sharpened triangle inequality , 2012, J. Discrete Algorithms.
[17] Harald Hempel,et al. Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights , 2009, LATA.
[18] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[19] Kenneth Steiglitz,et al. Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..
[20] Juraj Hromkovic,et al. Reoptimization of Steiner Trees , 2008, SWAT.
[21] Markus W. Schäffter,et al. Scheduling with Forbidden Sets , 1997, Discret. Appl. Math..