Author:
Ausiello Giorgio,Escoffier Bruno,Monnot Jérôme,Paschos Vangelis Th.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Archetti, C., Bertazzi, L., Speranza, M.G.: Reoptimizing the traveling salesman problem. Networks 42(3), 154–159 (2003)
2. Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. 16, 201–240 (1988)
3. Bartusch, M., Mohring, R.H., Radermacher, F.J.: A conceptional outline of a dss for scheduling problems in the building industry. Decision Support Systems 5, 321–344 (1989)
4. Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processessing Letters 95, 333–342 (2005)
5. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 338, Grad School of Industrial Administration, Canergi-Mellon University, Pittsburgh (1976)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding Optimal Solutions with Neighborly Help;Algorithmica;2024-03-06
2. Reoptimization of parameterized problems;Acta Informatica;2022-07-25
3. Reoptimization of NP-Hard Problems;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018
4. Stability of Reapproximation Algorithms for the $$\beta $$ β -Metric Traveling Salesman (Path) Problem;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018
5. On the Limits of Recursively Self-Improving AGI;Artificial General Intelligence;2015