Hougardy, Stefan; Zhong, Xianghui Hard to solve instances of the Euclidean traveling salesman problem. (English) Zbl 1473.90083 Math. Program. Comput. 13, No. 1, 51-74 (2021). MSC: 90C05 90C06 90C10 90C27 PDF BibTeX XML Cite \textit{S. Hougardy} and \textit{X. Zhong}, Math. Program. Comput. 13, No. 1, 51--74 (2021; Zbl 1473.90083) Full Text: DOI arXiv OpenURL
Gaudio, Julia; Jaillet, Patrick An improved lower bound for the traveling salesman constant. (English) Zbl 07165985 Oper. Res. Lett. 48, No. 1, 67-70 (2020). MSC: 90-XX PDF BibTeX XML Cite \textit{J. Gaudio} and \textit{P. Jaillet}, Oper. Res. Lett. 48, No. 1, 67--70 (2020; Zbl 07165985) Full Text: DOI arXiv OpenURL
Skubalska-Rafajłowicz, Ewa Exploring the solution space of the Euclidean traveling salesman problem using a Kohonen SOM neural network. (English) Zbl 1486.68221 Rutkowski, Leszek (ed.) et al., Artificial intelligence and soft computing. 16th international conference, ICAISC 2017, Zakopane, Poland, June 11–15, 2017. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 10245, 165-174 (2017). MSC: 68U05 68T05 PDF BibTeX XML Cite \textit{E. Skubalska-Rafajłowicz}, Lect. Notes Comput. Sci. 10245, 165--174 (2017; Zbl 1486.68221) Full Text: DOI OpenURL
Frieze, Alan; Pegden, Wesley Traveling in randomly embedded random graphs. (English) Zbl 1467.05243 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 45, 17 p. (2017). MSC: 05C80 05C38 05C12 05C35 90C35 PDF BibTeX XML Cite \textit{A. Frieze} and \textit{W. Pegden}, LIPIcs -- Leibniz Int. Proc. Inform. 81, Article 45, 17 p. (2017; Zbl 1467.05243) Full Text: DOI OpenURL
Fischer, Anja; Hungerländer, Philipp The traveling salesman problem on grids with forbidden neighborhoods. (English) Zbl 1383.90029 J. Comb. Optim. 34, No. 3, 891-915 (2017). MSC: 90C27 05C38 PDF BibTeX XML Cite \textit{A. Fischer} and \textit{P. Hungerländer}, J. Comb. Optim. 34, No. 3, 891--915 (2017; Zbl 1383.90029) Full Text: DOI OpenURL
Pferschy, Ulrich; Staněk, Rostislav Generating subtour elimination constraints for the TSP from pure integer solutions. (English) Zbl 1364.90296 CEJOR, Cent. Eur. J. Oper. Res. 25, No. 1, 231-260 (2017). MSC: 90C27 PDF BibTeX XML Cite \textit{U. Pferschy} and \textit{R. Staněk}, CEJOR, Cent. Eur. J. Oper. Res. 25, No. 1, 231--260 (2017; Zbl 1364.90296) Full Text: DOI arXiv OpenURL
Arlotto, Alessandro; Steele, J. Michael Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample. (English) Zbl 1375.60036 Ann. Appl. Probab. 26, No. 4, 2141-2168 (2016). MSC: 60D05 90B15 60F15 60G10 60G55 90C27 PDF BibTeX XML Cite \textit{A. Arlotto} and \textit{J. M. Steele}, Ann. Appl. Probab. 26, No. 4, 2141--2168 (2016; Zbl 1375.60036) Full Text: DOI arXiv Euclid OpenURL
Hougardy, Stefan On the integrality ratio of the subtour LP for Euclidean TSP. (English) Zbl 1408.90253 Oper. Res. Lett. 42, No. 8, 495-499 (2014). MSC: 90C27 90C60 68W25 PDF BibTeX XML Cite \textit{S. Hougardy}, Oper. Res. Lett. 42, No. 8, 495--499 (2014; Zbl 1408.90253) Full Text: DOI arXiv OpenURL
Niel, Blanca I. Every longest Hamiltonian path in even \(n\)-gons. (English) Zbl 1257.05080 Discrete Math. Algorithms Appl. 4, No. 4, Paper No. 1250057, 16 p. (2012). MSC: 05C45 05C12 05C38 05C22 05C35 90B10 90C35 PDF BibTeX XML Cite \textit{B. I. Niel}, Discrete Math. Algorithms Appl. 4, No. 4, Paper No. 1250057, 16 p. (2012; Zbl 1257.05080) Full Text: DOI OpenURL
Wang, Yu-Ting; Li, Jun-Qing; Gao, Kai-Zhou; Pan, Quan-Ke Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem. (English) Zbl 1231.90327 Comput. Math. Appl. 62, No. 7, 2743-2754 (2011). MSC: 90C27 68Q17 PDF BibTeX XML Cite \textit{Y.-T. Wang} et al., Comput. Math. Appl. 62, No. 7, 2743--2754 (2011; Zbl 1231.90327) Full Text: DOI OpenURL
Vöcking, Berthold (ed.); Alt, Helmut (ed.); Dietzfelbinger, Martin (ed.); Reischuk, Rüdiger (ed.); Scheideler, Christian (ed.); Vollmer, Heribert (ed.); Wagner, Dorothea (ed.) Algorithms unplugged. (English) Zbl 1206.68024 Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). x, 406 p. (2011). MSC: 68-01 68-06 68W01 97P10 PDF BibTeX XML Cite \textit{B. Vöcking} (ed.) et al., Algorithms unplugged. Berlin: Springer (2011; Zbl 1206.68024) Full Text: DOI OpenURL
Elbassioni, Khaled; Fishkin, Aleksei V.; Sitters, René Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods. (English) Zbl 1172.65028 Int. J. Comput. Geom. Appl. 19, No. 2, 173-193 (2009). Reviewer: Vasilis Dimitriou (Chania) MSC: 65K05 90C05 PDF BibTeX XML Cite \textit{K. Elbassioni} et al., Int. J. Comput. Geom. Appl. 19, No. 2, 173--193 (2009; Zbl 1172.65028) Full Text: DOI OpenURL
Koo, Yooyoung; Lee, Sungchul Rates of convergence of means of Euclidean functionals. (English) Zbl 1153.60017 J. Theor. Probab. 20, No. 4, 821-841 (2007). Reviewer: V. M. Kruglov (Moskva) MSC: 60F15 60D05 PDF BibTeX XML Cite \textit{Y. Koo} and \textit{S. Lee}, J. Theor. Probab. 20, No. 4, 821--841 (2007; Zbl 1153.60017) Full Text: DOI arXiv Link OpenURL
Aldous, David J.; Krikun, Maxim Percolating paths through random points. (English) Zbl 1122.60084 ALEA, Lat. Am. J. Probab. Math. Stat. 1, 89-109 (2006). Reviewer: Bo Markussen (Kopenhagen) MSC: 60K35 60C05 60G55 PDF BibTeX XML Cite \textit{D. J. Aldous} and \textit{M. Krikun}, ALEA, Lat. Am. J. Probab. Math. Stat. 1, 89--109 (2006; Zbl 1122.60084) Full Text: arXiv OpenURL
Barvinok, Alexander; Fekete, Sándor P.; Johnson, David S.; Tamir, Arie; Woeginger, Gerhard J.; Woodroofe, Russ The geometric maximum traveling salesman problem. (English) Zbl 1325.90074 J. ACM 50, No. 5, 641-664 (2003). MSC: 90C27 68Q17 68Q25 90C35 PDF BibTeX XML Cite \textit{A. Barvinok} et al., J. ACM 50, No. 5, 641--664 (2003; Zbl 1325.90074) Full Text: DOI OpenURL
Beutelspacher, Albrecht Mathematics for the coat pocket. From abacus to chance. 3. Aufl. (Mathematik für die Westentasche. Von Abakus bis Zufall.) (German) Zbl 1033.00005 München: Piper (ISBN 3-492-04353-4/hbk). 114 S. (2003). Reviewer: Ralph-Hardo Schulz (Berlin) MSC: 00A08 00A05 97A20 PDF BibTeX XML Cite \textit{A. Beutelspacher}, Mathematik für die Westentasche. Von Abakus bis Zufall. 3. Aufl. München: Piper (2003; Zbl 1033.00005) OpenURL
Ahn, Hee-Kap; Cheong, Otfried; Shin, Chan-Su Building bridges between convex regions. (English) Zbl 1022.52003 Comput. Geom. 25, No. 1-2, 161-170 (2003). Reviewer: Mihai Cipu (Bucureşti) MSC: 52A20 52A40 PDF BibTeX XML Cite \textit{H.-K. Ahn} et al., Comput. Geom. 25, No. 1--2, 161--170 (2003; Zbl 1022.52003) Full Text: DOI OpenURL
Dumitrescu, Adrian; Mitchell, Joseph S. B. Approximation algorithms for TSP with neighborhoods in the plane. (English) Zbl 1018.90038 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 38-46 (2001). MSC: 90C27 90C59 65Y20 90C35 PDF BibTeX XML Cite \textit{A. Dumitrescu} and \textit{J. S. B. Mitchell}, in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 38--46 (2001; Zbl 1018.90038) OpenURL
Rubinstein, J. H.; Thomas, D. A.; Wormald, N. C. A polynomial algorithm for a constrained traveling salesman problem. (English) Zbl 0990.90102 Networks 38, No. 2, 68-75 (2001). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{J. H. Rubinstein} et al., Networks 38, No. 2, 68--75 (2001; Zbl 0990.90102) Full Text: DOI OpenURL
Altinel, İ. Kuban; Aras, Necati; Oommen, B. John Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches. (English) Zbl 0944.90007 Comput. Oper. Res. 27, No. 5, 461-494 (2000). MSC: 90B10 90C27 PDF BibTeX XML Cite \textit{İ. K. Altinel} et al., Comput. Oper. Res. 27, No. 5, 461--494 (2000; Zbl 0944.90007) Full Text: DOI OpenURL
Burkard, Rainer E.; Deĭneko, Vladimir G. On the traveling salesman problem with a relaxed Monge matrix. (English) Zbl 1339.90275 Inf. Process. Lett. 67, No. 5, 231-237 (1998). MSC: 90C27 PDF BibTeX XML Cite \textit{R. E. Burkard} and \textit{V. G. Deĭneko}, Inf. Process. Lett. 67, No. 5, 231--237 (1998; Zbl 1339.90275) Full Text: DOI Link OpenURL
Arora, Sanjeev Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. (Abstract). (English) Zbl 0911.90333 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 1-2 (1998). MSC: 90C35 90C60 PDF BibTeX XML Cite \textit{S. Arora}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 1--2 (1998; Zbl 0911.90333) OpenURL
Tassiulas, L. Worst case length of nearest neighbor tours for the euclidean traveling salesman problem. (English) Zbl 0874.68228 SIAM J. Discrete Math. 10, No. 2, 171-179 (1997). MSC: 68R10 90C27 PDF BibTeX XML Cite \textit{L. Tassiulas}, SIAM J. Discrete Math. 10, No. 2, 171--179 (1997; Zbl 0874.68228) Full Text: DOI OpenURL
Codenotti, Bruno; Manzini, Giovanni; Margara, Luciano; Resta, Giovanni Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP. (English) Zbl 0866.90130 INFORMS J. Comput. 8, No. 2, 125-133 (1996). MSC: 90C35 90C06 PDF BibTeX XML Cite \textit{B. Codenotti} et al., INFORMS J. Comput. 8, No. 2, 125--133 (1996; Zbl 0866.90130) Full Text: DOI Link OpenURL
Redmond, C.; Yukich, J. E. Asymptotics for Euclidean functionals with power-weighted edges. (English) Zbl 0849.60030 Stochastic Processes Appl. 61, No. 2, 289-304 (1996). MSC: 60F99 PDF BibTeX XML Cite \textit{C. Redmond} and \textit{J. E. Yukich}, Stochastic Processes Appl. 61, No. 2, 289--304 (1996; Zbl 0849.60030) Full Text: DOI OpenURL
Snyder, Timothy Law; Steele, J. Michael Probabilistic networks and network algorithms. (English) Zbl 0839.90136 Ball, M. O. (ed.) et al., Network models. Amsterdam: North-Holland. Handb. Oper. Res. Manage. Sci. 7, 401-424 (1995). MSC: 90C35 90B15 90B10 PDF BibTeX XML Cite \textit{T. L. Snyder} and \textit{J. M. Steele}, Handb. Oper. Res. Manage. Sci. 7, 401--424 (1995; Zbl 0839.90136) OpenURL
Snyder, Timothy Law; Steele, J. Michael A priori bounds on the Euclidean traveling salesman. (English) Zbl 0831.68077 SIAM J. Comput. 24, No. 3, 665-671 (1995). MSC: 68R10 05C45 90C35 68U05 PDF BibTeX XML Cite \textit{T. L. Snyder} and \textit{J. M. Steele}, SIAM J. Comput. 24, No. 3, 665--671 (1995; Zbl 0831.68077) Full Text: DOI OpenURL
Yukich, J. E. Asymptotics for the Euclidean TSP with power weighted edges. (English) Zbl 0821.60023 Probab. Theory Relat. Fields 102, No. 2, 203-220 (1995). MSC: 60D05 60F15 60C05 PDF BibTeX XML Cite \textit{J. E. Yukich}, Probab. Theory Relat. Fields 102, No. 2, 203--220 (1995; Zbl 0821.60023) Full Text: DOI OpenURL
Tate, D. M.; Tunasar, C.; Smith, A. E. Genetically improved presequences for Euclidean traveling salesman problems. (English) Zbl 0810.90130 Math. Comput. Modelling 20, No. 2, 135-143 (1994). MSC: 90C35 PDF BibTeX XML Cite \textit{D. M. Tate} et al., Math. Comput. Modelling 20, No. 2, 135--143 (1994; Zbl 0810.90130) Full Text: DOI OpenURL
Alexander, Kenneth S. Rates of convergence of means for distance-minimizing subadditive Euclidean functionals. (English) Zbl 0809.60016 Ann. Appl. Probab. 4, No. 3, 902-922 (1994). Reviewer: I.S.Molchanov (Amsterdam) MSC: 60D05 05C80 90C27 PDF BibTeX XML Cite \textit{K. S. Alexander}, Ann. Appl. Probab. 4, No. 3, 902--922 (1994; Zbl 0809.60016) Full Text: DOI OpenURL
Deineko, Vladimir G.; van Dal, René; Rote, Günter The convex-hull-and-line traveling salesman problem: A solvable case. (English) Zbl 0806.90121 Inf. Process. Lett. 51, No. 3, 141-148 (1994). MSC: 90C35 90C60 PDF BibTeX XML Cite \textit{V. G. Deineko} et al., Inf. Process. Lett. 51, No. 3, 141--148 (1994; Zbl 0806.90121) Full Text: DOI Link OpenURL
Perttunen, Jukka On the solving strategy in composite heuristics. (English) Zbl 0757.90083 Oper. Res. Lett. 12, No. 3, 165-172 (1992). MSC: 90C35 90-08 PDF BibTeX XML Cite \textit{J. Perttunen}, Oper. Res. Lett. 12, No. 3, 165--172 (1992; Zbl 0757.90083) Full Text: DOI OpenURL
Martin, Olivier; Otto, Steve W.; Felten, Edward W. Large-step Markov chains for the TSP incorporating local search heuristics. (English) Zbl 0760.90090 Oper. Res. Lett. 11, No. 4, 219-224 (1992). MSC: 90C35 90-08 PDF BibTeX XML Cite \textit{O. Martin} et al., Oper. Res. Lett. 11, No. 4, 219--224 (1992; Zbl 0760.90090) Full Text: DOI OpenURL
Rote, Günter The \(N\)-line traveling salesman problem. (English) Zbl 0783.90118 Networks 22, No. 1, 91-108 (1992). Reviewer: C.Radu (Iaşi) MSC: 90C35 90C39 90-08 PDF BibTeX XML Cite \textit{G. Rote}, Networks 22, No. 1, 91--108 (1992; Zbl 0783.90118) Full Text: DOI OpenURL
Steele, J. Michael Probability and problems in Euclidean combinatorial optimization. (English) Zbl 0768.90063 Probability and algorithms, 109-129 (1992). MSC: 90C27 90-02 90C35 PDF BibTeX XML Cite \textit{J. M. Steele}, in: Probability and algorithms. Washington, DC: National Academy Press. 109--129 (1992; Zbl 0768.90063) OpenURL
Jaillet, Patrick Rates of convergence for quasi-additive smooth Euclidean functionals and application to combinatorial optimization problems. (English) Zbl 0770.90052 Math. Oper. Res. 17, No. 4, 964-980 (1992). MSC: 90C27 60D05 90C35 PDF BibTeX XML Cite \textit{P. Jaillet}, Math. Oper. Res. 17, No. 4, 964--980 (1992; Zbl 0770.90052) Full Text: DOI Link OpenURL
Toledo, Sivan Maximizing non-linear concave functions in fixed dimension. (English) Zbl 0917.52005 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24–27, 1992. Washington, DC: IEEE Computer Society Press, 676-685 (1992). MSC: 52A20 68Q25 52A41 PDF BibTeX XML Cite \textit{S. Toledo}, in: 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24--27, 1992. Washington, DC: IEEE Computer Society Press. 676--685 (1992; Zbl 0917.52005) OpenURL
Goemans, Michel X.; Bertsimas, Dimitris J. Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. (English) Zbl 0733.90072 Math. Oper. Res. 16, No. 1, 72-89 (1991). MSC: 90C35 90C27 90C60 90-08 PDF BibTeX XML Cite \textit{M. X. Goemans} and \textit{D. J. Bertsimas}, Math. Oper. Res. 16, No. 1, 72--89 (1991; Zbl 0733.90072) Full Text: DOI OpenURL
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. Multiple stack branch and bound. (English) Zbl 0711.68050 Inf. Process. Lett. 37, No. 1, 43-48 (1991). MSC: 68W10 90C27 PDF BibTeX XML Cite \textit{U. K. Sarkar} et al., Inf. Process. Lett. 37, No. 1, 43--48 (1991; Zbl 0711.68050) Full Text: DOI OpenURL
Cronin, T. M. The Voronoi diagram for the Euclidean traveling salesman problem is piecemeal quartic and hyperbolic. (English) Zbl 0744.90071 Applied mathematics and computing, Trans. 8th Army Conf., Ithaca/NY (USA) 1990, ARO Rep. 91-1, 195-223 (1991). Reviewer: R.Euler (Brest) MSC: 90C27 65D18 90C60 PDF BibTeX XML Cite \textit{T. M. Cronin}, in: Global existence, regularity, and boundedness for the Kuramoto- Sivashinsky equation in thin 2D domains. . 195--223 (1991; Zbl 0744.90071) OpenURL
Steele, J. Michael Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space. (English) Zbl 0717.90060 Math. Oper. Res. 15, No. 4, 749-770 (1990). MSC: 90C27 90B80 65K05 90-02 PDF BibTeX XML Cite \textit{J. M. Steele}, Math. Oper. Res. 15, No. 4, 749--770 (1990; Zbl 0717.90060) Full Text: DOI OpenURL
Goddyn, Luis A. Quantizers ad the worst case Euclidean traveling salesman problem. (English) Zbl 0658.90089 J. Comb. Theory, Ser. B 50, No. 1, 65-81 (1990). Reviewer: L.A.Goddyn MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{L. A. Goddyn}, J. Comb. Theory, Ser. B 50, No. 1, 65--81 (1990; Zbl 0658.90089) Full Text: DOI OpenURL
Karloff, Howard J. How long can a Euclidean traveling salesman tour be? (English) Zbl 0682.05041 SIAM J. Discrete Math. 2, No. 1, 91-99 (1989). Reviewer: F.Plastria MSC: 05C38 90B05 05C45 51M05 68R10 PDF BibTeX XML Cite \textit{H. J. Karloff}, SIAM J. Discrete Math. 2, No. 1, 91--99 (1989; Zbl 0682.05041) Full Text: DOI OpenURL
Kern, Walter A probabilistic analysis of the switching algorithm for the Euclidean TSP. (English) Zbl 0675.90086 Math. Program., Ser. A 44, No. 2, 213-219 (1989). Reviewer: C.Bouza MSC: 90C35 68Q25 PDF BibTeX XML Cite \textit{W. Kern}, Math. Program. 44, No. 2 (A), 213--219 (1989; Zbl 0675.90086) Full Text: DOI OpenURL
Sergienko, I. V. (ed.) Application program packages and numerical methods. (Pakety prikladnykh programm i chislennye metody.) (Russian) Zbl 0751.65002 Kiev: Institut Kibernetiki AN USSR, 141 p. (1988). MSC: 65-06 00B15 90-04 45-04 47-04 42-04 35-04 34-04 15-04 PDF BibTeX XML Cite \textit{I. V. Sergienko} (ed.), Pakety prikladnykh programm i chislennye metody (Russian). Kiev: Institut Kibernetiki AN USSR (1988; Zbl 0751.65002) OpenURL
Gurke, Renate The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP. (English) Zbl 0659.65064 Parallel Comput. 8, No. 1-3, 177-183 (1988). Reviewer: A.Guruli MSC: 65K05 90B10 65Y05 PDF BibTeX XML Cite \textit{R. Gurke}, Parallel Comput. 8, No. 1--3, 177--183 (1988; Zbl 0659.65064) Full Text: DOI OpenURL
Volgenant, A.; van der Sluis, H. J.; Jonker, R. Better assignment lower bounds for the Euclidean traveling salesman problem. (English) Zbl 0633.90088 Optimization 18, 393-404 (1987). MSC: 90C35 90C10 65K05 05C35 PDF BibTeX XML Cite \textit{A. Volgenant} et al., Optimization 18, 393--404 (1987; Zbl 0633.90088) Full Text: DOI OpenURL
Rossier, Y.; Troyon, M.; Liebling, Th. M. Probabilistic exchange algorithms and Euclidean traveling salesman problems. (English) Zbl 0596.90069 OR Spektrum 8, 151-164 (1986). Reviewer: H.Noltemeier MSC: 90C10 90C35 65K05 60J10 PDF BibTeX XML Cite \textit{Y. Rossier} et al., OR Spektrum 8, 151--164 (1986; Zbl 0596.90069) Full Text: DOI OpenURL
Stewart, William R. jun. An improved assignment lower bound for the Euclidean traveling salesman problem. (English) Zbl 0565.90077 Oper. Res. Lett. 4, 55-60 (1985). MSC: 90C35 65K05 05C35 90C10 90B10 PDF BibTeX XML Cite \textit{W. R. Stewart jun.}, Oper. Res. Lett. 4, 55--60 (1985; Zbl 0565.90077) Full Text: DOI OpenURL
Karp, Richard M. The probabilistic analysis of combinatorial optimization algorithms. (English) Zbl 0584.68053 Proc. Int. Congr. Math., Warszawa 1983, Vol. 2, 1601-1609 (1984). MSC: 68W99 68Q25 68R10 05C80 90C35 PDF BibTeX XML OpenURL
Moran, Shlomo On the length of optimal TSP circuits in sets of bounded diameter. (English) Zbl 0557.52008 J. Comb. Theory, Ser. B 37, 113-141 (1984). Reviewer: N.Alon MSC: 52A40 05C35 PDF BibTeX XML Cite \textit{S. Moran}, J. Comb. Theory, Ser. B 37, 113--141 (1984; Zbl 0557.52008) Full Text: DOI OpenURL
Papadimitriou, Christos H.; Vazirani, Umesh V. On two geometric problems related to the travelling salesman problem. (English) Zbl 0551.90093 J. Algorithms 5, 231-246 (1984). Reviewer: T.Ibaraki MSC: 90C35 68Q25 05C35 90C10 PDF BibTeX XML Cite \textit{C. H. Papadimitriou} and \textit{U. V. Vazirani}, J. Algorithms 5, 231--246 (1984; Zbl 0551.90093) Full Text: DOI OpenURL
Kantabutra, Vitit Traveling salesman cycles are not always subgraphs of Voronoi duals. (English) Zbl 0521.05045 Inf. Process. Lett. 16, 11-12 (1983). MSC: 05C45 PDF BibTeX XML Cite \textit{V. Kantabutra}, Inf. Process. Lett. 16, 11--12 (1983; Zbl 0521.05045) Full Text: DOI OpenURL
Itai, Alon; Papadimitriou, Christos H.; Szwarcfiter, Jayme Luiz Hamilton paths in grid graphs. (English) Zbl 0506.05043 SIAM J. Comput. 11, 676-686 (1982). MSC: 05C45 68Q25 PDF BibTeX XML Cite \textit{A. Itai} et al., SIAM J. Comput. 11, 676--686 (1982; Zbl 0506.05043) Full Text: DOI Link OpenURL
Steele, J. Michael Complete convergence of short paths and Karp’s algorithm for the TSP. (English) Zbl 0496.90078 Math. Oper. Res. 6, 374-378 (1981). MSC: 90C35 90C10 60B10 68Q25 60F17 68W99 PDF BibTeX XML Cite \textit{J. M. Steele}, Math. Oper. Res. 6, 374--378 (1981; Zbl 0496.90078) Full Text: DOI Link OpenURL
Steele, J. Michael Subadditive Euclidean functionals and nonlinear growth in geometric probability. (English) Zbl 0461.60029 Ann. Probab. 9, 365-376 (1981). MSC: 60D05 60F15 60G55 60C05 PDF BibTeX XML Cite \textit{J. M. Steele}, Ann. Probab. 9, 365--376 (1981; Zbl 0461.60029) Full Text: DOI OpenURL
D’Atri, Gianfranco A note on heuristics for the traveling salesman problem. (English) Zbl 0437.90062 Math. Program. 19, 111-114 (1980). MSC: 90C10 65K05 68Q60 PDF BibTeX XML Cite \textit{G. D'Atri}, Math. Program. 19, 111--114 (1980; Zbl 0437.90062) Full Text: DOI OpenURL