Carr, Robert; Ravi, R.; Simonetti, Neil A new integer programming formulation of the graphical traveling salesman problem. (English) Zbl 07662920 Math. Program. 197, No. 2 (B), 877-902 (2023). MSC: 90C11 90C27 PDF BibTeX XML Cite \textit{R. Carr} et al., Math. Program. 197, No. 2 (B), 877--902 (2023; Zbl 07662920) Full Text: DOI OpenURL
Dietz, Audrey; Adams, Warren; Yang, Boshi A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions. (English) Zbl 07659732 Optim. Lett. 17, No. 2, 245-264 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{A. Dietz} et al., Optim. Lett. 17, No. 2, 245--264 (2023; Zbl 07659732) Full Text: DOI OpenURL
Kou, Shuhan; Golden, Bruce; Poikonen, Stefan Optimal TSP tour length estimation using Sammon maps. (English) Zbl 07643572 Optim. Lett. 17, No. 1, 89-105 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{S. Kou} et al., Optim. Lett. 17, No. 1, 89--105 (2023; Zbl 07643572) Full Text: DOI OpenURL
Sun, Jian; Gutin, Gregory; Li, Ping; Shi, Peihao; Zhang, Xiaoyan An LP-based approximation algorithm for the generalized traveling salesman path problem. (English) Zbl 07638358 Theor. Comput. Sci. 941, 180-190 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Sun} et al., Theor. Comput. Sci. 941, 180--190 (2023; Zbl 07638358) Full Text: DOI OpenURL
Pralet, Cédric Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version. (English) Zbl 07634108 Comput. Oper. Res. 150, Article ID 106078, 20 p. (2023). MSC: 90Bxx PDF BibTeX XML Cite \textit{C. Pralet}, Comput. Oper. Res. 150, Article ID 106078, 20 p. (2023; Zbl 07634108) Full Text: DOI OpenURL
Gnegel, Fabian; Fügenschuh, Armin Branch-and-refine for solving time-expanded MILP formulations. (English) Zbl 07634085 Comput. Oper. Res. 149, Article ID 106043, 15 p. (2023). MSC: 90Bxx PDF BibTeX XML Cite \textit{F. Gnegel} and \textit{A. Fügenschuh}, Comput. Oper. Res. 149, Article ID 106043, 15 p. (2023; Zbl 07634085) Full Text: DOI OpenURL
Sun, Yuhui; Yu, Wei; Liu, Zhaohui Approximation algorithms for some min-max and minimum stacker crane cover problems. (English) Zbl 07625354 J. Comb. Optim. 45, No. 1, Paper No. 18, 25 p. (2023). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{Y. Sun} et al., J. Comb. Optim. 45, No. 1, Paper No. 18, 25 p. (2023; Zbl 07625354) Full Text: DOI OpenURL
Zavalishchin, Dmitriĭ Stanislavovich; Vakolyuk, Kirill Konstantinovich Parallel delivery operations modelling. (English) Zbl 07666055 Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 15, No. 4, 109-114 (2022). MSC: 90B06 PDF BibTeX XML Cite \textit{D. S. Zavalishchin} and \textit{K. K. Vakolyuk}, Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 15, No. 4, 109--114 (2022; Zbl 07666055) Full Text: DOI MNR OpenURL
Khachay, M. Yu.; Neznakhina, E. D.; Ryzhenko, K. V. Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem. (English. Russian original) Zbl 07661459 Proc. Steklov Inst. Math. 319, Suppl. 1, S140-S155 (2022); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241-258 (2022). MSC: 90C27 90C35 90B06 PDF BibTeX XML Cite \textit{M. Yu. Khachay} et al., Proc. Steklov Inst. Math. 319, S140--S155 (2022; Zbl 07661459); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241--258 (2022) Full Text: DOI OpenURL
Wang, Yang; Chen, Zhibin Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem. (English) Zbl 07659460 Math. Biosci. Eng. 19, No. 10, 9730-9748 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{Y. Wang} and \textit{Z. Chen}, Math. Biosci. Eng. 19, No. 10, 9730--9748 (2022; Zbl 07659460) Full Text: DOI OpenURL
Fei, Teng; Wu, Xinxin; Zhang, Liyi; Zhang, Yong; Chen, Lei Research on improved ant colony optimization for traveling salesman problem. (English) Zbl 07659099 Math. Biosci. Eng. 19, No. 8, 8152-8186 (2022). MSC: 90Cxx 90Bxx PDF BibTeX XML Cite \textit{T. Fei} et al., Math. Biosci. Eng. 19, No. 8, 8152--8186 (2022; Zbl 07659099) Full Text: DOI OpenURL
Lera-Romero, Gonzalo; Bront, Juan José Miranda; Soulignac, Francisco J. Dynamic programming for the time-dependent traveling salesman problem with time windows. (English) Zbl 07640794 INFORMS J. Comput. 34, No. 6, 3292-3308 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{G. Lera-Romero} et al., INFORMS J. Comput. 34, No. 6, 3292--3308 (2022; Zbl 07640794) Full Text: DOI OpenURL
Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland A 3/2-approximation for the metric many-visits path TSP. (English) Zbl 07630938 SIAM J. Discrete Math. 36, No. 4, 2995-3030 (2022). MSC: 90C27 90C35 90C59 05C85 05B35 PDF BibTeX XML Cite \textit{K. Bérczi} et al., SIAM J. Discrete Math. 36, No. 4, 2995--3030 (2022; Zbl 07630938) Full Text: DOI arXiv OpenURL
Herraiz, A.; Gutierrez, M.; Ortega-Mier, M. Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation. (English) Zbl 07630660 CEJOR, Cent. Eur. J. Oper. Res. 30, No. 4, 1427-1450 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Herraiz} et al., CEJOR, Cent. Eur. J. Oper. Res. 30, No. 4, 1427--1450 (2022; Zbl 07630660) Full Text: DOI OpenURL
Li, Hui; Zhang, Mengyao; Zeng, Chenbo Circular Jaccard distance based multi-solution optimization for traveling salesman problems. (English) Zbl 07607641 Math. Biosci. Eng. 19, No. 5, 4458-4480 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{H. Li} et al., Math. Biosci. Eng. 19, No. 5, 4458--4480 (2022; Zbl 07607641) Full Text: DOI OpenURL
Zhang, Xiaoyan; Du, Donglei; Gutin, Gregory; Ming, Qiaoxia; Sun, Jian Approximation algorithms with constant ratio for general cluster routing problems. (English) Zbl 1504.90142 J. Comb. Optim. 44, No. 4, 2499-2514 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{X. Zhang} et al., J. Comb. Optim. 44, No. 4, 2499--2514 (2022; Zbl 1504.90142) Full Text: DOI OpenURL
Wu, Tengyu; He, Lin; Yu, Haiyan Online traveling salesman problem with time cost and non-zealous server. (English) Zbl 1502.90159 J. Comb. Optim. 44, No. 3, 2143-2166 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{T. Wu} et al., J. Comb. Optim. 44, No. 3, 2143--2166 (2022; Zbl 1502.90159) Full Text: DOI OpenURL
Bao, Xiaoguang; Xu, Lei; Yu, Wei; Song, Wei Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems. (English) Zbl 07593352 Theor. Comput. Sci. 933, 60-66 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{X. Bao} et al., Theor. Comput. Sci. 933, 60--66 (2022; Zbl 07593352) Full Text: DOI OpenURL
Kou, Shuhan; Golden, Bruce; Poikonen, Stefan Optimal TSP tour length estimation using standard deviation as a predictor. (English) Zbl 07593229 Comput. Oper. Res. 148, Article ID 105993, 10 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{S. Kou} et al., Comput. Oper. Res. 148, Article ID 105993, 10 p. (2022; Zbl 07593229) Full Text: DOI OpenURL
Xiao, Liyang; Zhen, Lu; Laporte, Gilbert; Baldacci, Roberto; Wang, Chenghao A column generation-based heuristic for a rehabilitation patient scheduling and routing problem. (English) Zbl 07593217 Comput. Oper. Res. 148, Article ID 105970, 19 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{L. Xiao} et al., Comput. Oper. Res. 148, Article ID 105970, 19 p. (2022; Zbl 07593217) Full Text: DOI OpenURL
Palacio, Juan D.; Rivera, Juan Carlos A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem. (English) Zbl 1501.90083 Ann. Oper. Res. 316, No. 2, 979-1011 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{J. D. Palacio} and \textit{J. C. Rivera}, Ann. Oper. Res. 316, No. 2, 979--1011 (2022; Zbl 1501.90083) Full Text: DOI OpenURL
Kundu, Abhishake; Escobar, Ricardo Gatica; Matis, Timothy I. An efficient routing heuristic for a drone-assisted delivery problem. (English) Zbl 07578501 IMA J. Manag. Math. 33, No. 4, 583-601 (2022). MSC: 90-XX 91-XX PDF BibTeX XML Cite \textit{A. Kundu} et al., IMA J. Manag. Math. 33, No. 4, 583--601 (2022; Zbl 07578501) Full Text: DOI OpenURL
Boyd, Sylvia; Cheriyan, Joseph; Cummings, Robert; Grout, Logan; Ibrahimpur, Sharat; Szigeti, Zoltán; Wang, Lu A \(\frac{4}{3} \)-approximation algorithm for the minimum 2-edge connected multisubgraph problem in the half-integral case. (English) Zbl 07572599 SIAM J. Discrete Math. 36, No. 3, 1730-1747 (2022). MSC: 68R10 90C27 90C35 05C40 05C85 PDF BibTeX XML Cite \textit{S. Boyd} et al., SIAM J. Discrete Math. 36, No. 3, 1730--1747 (2022; Zbl 07572599) Full Text: DOI arXiv OpenURL
Balkanski, Eric; Faenza, Yuri; Kubik, Mathieu The simultaneous semi-random model for TSP. (English) Zbl 1497.90163 Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 43-56 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{E. Balkanski} et al., Lect. Notes Comput. Sci. 13265, 43--56 (2022; Zbl 1497.90163) Full Text: DOI OpenURL
Adams, Colin Lost in the math museum. A survival story. (English) Zbl 1498.00003 Anneli Lax New Mathematical Library 55. Washington, DC: The Mathematical Association of America (MAA) (ISBN 978-1-4704-6858-3/pbk). xi, 209 p. (2022). Reviewer: Adhemar Bultheel (Leuven) MSC: 00A09 00A05 00A15 00A64 PDF BibTeX XML Cite \textit{C. Adams}, Lost in the math museum. A survival story. Washington, DC: The Mathematical Association of America (MAA) (2022; Zbl 1498.00003) OpenURL
Mao, Yuying; Yu, Wei; Liu, Zhaohui; Xiong, Jiafeng Approximation algorithms for some minimum postmen cover problems. (English) Zbl 1496.90079 Discrete Appl. Math. 319, 382-393 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{Y. Mao} et al., Discrete Appl. Math. 319, 382--393 (2022; Zbl 1496.90079) Full Text: DOI OpenURL
Liang, Yi-Jing; Luo, Zhi-Xing A survey of truck-drone routing problem: literature review and research prospects. (English) Zbl 07562517 J. Oper. Res. Soc. China 10, No. 2, 343-377 (2022). MSC: 90B06 PDF BibTeX XML Cite \textit{Y.-J. Liang} and \textit{Z.-X. Luo}, J. Oper. Res. Soc. China 10, No. 2, 343--377 (2022; Zbl 07562517) Full Text: DOI OpenURL
Luo, Yuchen; Golden, Bruce; Poikonen, Stefan; Zhang, Rui A fresh look at the traveling salesman problem with a center. (English) Zbl 07546510 Comput. Oper. Res. 143, Article ID 105748, 14 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Luo} et al., Comput. Oper. Res. 143, Article ID 105748, 14 p. (2022; Zbl 07546510) Full Text: DOI OpenURL
He, Pengfei; Hao, Jin-Kao Hybrid search with neighborhood reduction for the multiple traveling salesman problem. (English) Zbl 07546491 Comput. Oper. Res. 142, Article ID 105726, 19 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{P. He} and \textit{J.-K. Hao}, Comput. Oper. Res. 142, Article ID 105726, 19 p. (2022; Zbl 07546491) Full Text: DOI OpenURL
Chen, Sheng-I; Tseng, Yen-Che A partitioning column approach for solving LED sorter manipulator path planning problems. (English) Zbl 1494.90093 J. Ind. Manag. Optim. 18, No. 3, 2033-2047 (2022). MSC: 90C27 90C11 90C90 05A18 05C45 90B06 PDF BibTeX XML Cite \textit{S.-I Chen} and \textit{Y.-C. Tseng}, J. Ind. Manag. Optim. 18, No. 3, 2033--2047 (2022; Zbl 1494.90093) Full Text: DOI OpenURL
Ahn, Namsu; Kim, Soochan Optimal and heuristic algorithms for the multi-objective vehicle routing problem with drones for military surveillance operations. (English) Zbl 1499.90016 J. Ind. Manag. Optim. 18, No. 3, 1651-1663 (2022). MSC: 90B06 90C29 90C59 PDF BibTeX XML Cite \textit{N. Ahn} and \textit{S. Kim}, J. Ind. Manag. Optim. 18, No. 3, 1651--1663 (2022; Zbl 1499.90016) Full Text: DOI OpenURL
Vu, Duc Minh; Hewitt, Mike; Vu, Duc D. Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery. (English) Zbl 07538168 Eur. J. Oper. Res. 302, No. 3, 831-846 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. M. Vu} et al., Eur. J. Oper. Res. 302, No. 3, 831--846 (2022; Zbl 07538168) Full Text: DOI OpenURL
Bishop, Christopher J. The traveling salesman theorem for Jordan curves. (English) Zbl 1492.28002 Adv. Math. 404, Part A, Article ID 108443, 27 p. (2022). Reviewer: Antoine Julia (Paris) MSC: 28A75 26B15 30L05 42C99 49Q15 PDF BibTeX XML Cite \textit{C. J. Bishop}, Adv. Math. 404, Part A, Article ID 108443, 27 p. (2022; Zbl 1492.28002) Full Text: DOI OpenURL
Cherabli, Meriem; Ourbih-Tari, Megdouda; Boubalou, Meriem Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem. (English) Zbl 1493.65008 Monte Carlo Methods Appl. 28, No. 2, 175-188 (2022). MSC: 65C05 65C10 90C27 90C59 PDF BibTeX XML Cite \textit{M. Cherabli} et al., Monte Carlo Methods Appl. 28, No. 2, 175--188 (2022; Zbl 1493.65008) Full Text: DOI OpenURL
Gutekunst, Samuel C.; Williamson, David P. Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps. (English) Zbl 1492.90146 Math. Oper. Res. 47, No. 1, 1-28 (2022). MSC: 90C27 90C22 90C57 05C85 68R05 68W25 PDF BibTeX XML Cite \textit{S. C. Gutekunst} and \textit{D. P. Williamson}, Math. Oper. Res. 47, No. 1, 1--28 (2022; Zbl 1492.90146) Full Text: DOI arXiv OpenURL
Traub, Vera; Vygen, Jens An improved approximation algorithm for the asymmetric traveling salesman problem. (English) Zbl 07488098 SIAM J. Comput. 51, No. 1, 139-173 (2022). MSC: 68W25 05C85 90C27 PDF BibTeX XML Cite \textit{V. Traub} and \textit{J. Vygen}, SIAM J. Comput. 51, No. 1, 139--173 (2022; Zbl 07488098) Full Text: DOI OpenURL
Pereira, Armando Honorio; Mateus, Geraldo Robson; Urrutia, Sebastián Alberto Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (English) Zbl 1495.90161 Eur. J. Oper. Res. 300, No. 1, 207-220 (2022). MSC: 90C27 90B06 90C57 PDF BibTeX XML Cite \textit{A. H. Pereira} et al., Eur. J. Oper. Res. 300, No. 1, 207--220 (2022; Zbl 1495.90161) Full Text: DOI OpenURL
Lin, Jian; Zeng, Xiangfei; Liu, Jianxun; Li, Keqin Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem. (English) Zbl 1485.90113 J. Comb. Optim. 43, No. 1, 235-252 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Lin} et al., J. Comb. Optim. 43, No. 1, 235--252 (2022; Zbl 1485.90113) Full Text: DOI OpenURL
Jiang, Li; Zang, Xiaoning; Dong, Junfeng; Liang, Changyong A covering traveling salesman problem with profit in the last mile delivery. (English) Zbl 1484.90094 Optim. Lett. 16, No. 1, 375-393 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{L. Jiang} et al., Optim. Lett. 16, No. 1, 375--393 (2022; Zbl 1484.90094) Full Text: DOI OpenURL
Nascimento Silva, Janio Carlos; Coelho, Igor M.; Souza, Ueverton S.; Ochi, Luiz Satoru; Coelho, Vitor N. Finding the maximum multi improvement on neighborhood exploration. (English) Zbl 1483.90182 Optim. Lett. 16, No. 1, 97-115 (2022). MSC: 90C59 90C39 90C27 PDF BibTeX XML Cite \textit{J. C. Nascimento Silva} et al., Optim. Lett. 16, No. 1, 97--115 (2022; Zbl 1483.90182) Full Text: DOI OpenURL
Zhang, Yubai; Zhang, Zhao; Liu, Zhaohui; Chen, Qirong An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem. (English) Zbl 07444806 Inf. Process. Lett. 174, Article ID 106177, 8 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Zhang} et al., Inf. Process. Lett. 174, Article ID 106177, 8 p. (2022; Zbl 07444806) Full Text: DOI OpenURL
Graczyk, Jacek; Mihalache, Nicolae Optimal bounds for the analytical traveling salesman problem. (English) Zbl 1482.30069 J. Math. Anal. Appl. 507, No. 2, Article ID 125811, 11 p. (2022). MSC: 30C85 PDF BibTeX XML Cite \textit{J. Graczyk} and \textit{N. Mihalache}, J. Math. Anal. Appl. 507, No. 2, Article ID 125811, 11 p. (2022; Zbl 1482.30069) Full Text: DOI OpenURL
Kowalik, Łukasz; Li, Shaohua; Nadara, Wojciech; Smulewicz, Marcin; Wahlström, Magnus Many-visits TSP revisited. (English) Zbl 1478.68464 J. Comput. Syst. Sci. 124, 112-128 (2022). MSC: 68W40 68W20 90C27 PDF BibTeX XML Cite \textit{Ł. Kowalik} et al., J. Comput. Syst. Sci. 124, 112--128 (2022; Zbl 1478.68464) Full Text: DOI arXiv OpenURL
Maskooki, Alaleh; Deb, Kalyanmoy; Kallio, Markku A customized genetic algorithm for bi-objective routing in a dynamic network. (English) Zbl 1487.90144 Eur. J. Oper. Res. 297, No. 2, 615-629 (2022). MSC: 90B06 90C27 90C29 90C35 90C59 PDF BibTeX XML Cite \textit{A. Maskooki} et al., Eur. J. Oper. Res. 297, No. 2, 615--629 (2022; Zbl 1487.90144) Full Text: DOI OpenURL
Righini, Giovanni Efficient optimization of the Held-Karp lower bound. (English) Zbl 1497.90183 OJMO, Open J. Math. Optim. 2, Article No. 9, 17 p. (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{G. Righini}, OJMO, Open J. Math. Optim. 2, Article No. 9, 17 p. (2021; Zbl 1497.90183) Full Text: DOI OpenURL
Sun, Yuhui; Yu, Wei; Liu, Zhaohui Approximation algorithms for some min-max and minimum stacker crane cover problems. (English) Zbl 07550540 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 400-415 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{Y. Sun} et al., Lect. Notes Comput. Sci. 13135, 400--415 (2021; Zbl 07550540) Full Text: DOI OpenURL
Pérez-Escalona, Pedro; Rapaport, Ivan; Soto, José; Vidal, Ian The multiple traveling salesman problem on spiders. (English) Zbl 1490.90253 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 337-348 (2021). MSC: 90C27 68Q17 68W25 90C59 PDF BibTeX XML Cite \textit{P. Pérez-Escalona} et al., Lect. Notes Comput. Sci. 12607, 337--348 (2021; Zbl 1490.90253) Full Text: DOI OpenURL
de Oliveira, Sabrina M.; Bezerra, Leonardo C. T.; Stützle, Thomas; Dorigo, Marco; Wanner, Elizabeth F.; de Souza, Sérgio R. A computational study on ant colony optimization for the traveling salesman problem with dynamic demands. (English) Zbl 07486229 Comput. Oper. Res. 135, Article ID 105359, 19 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{S. M. de Oliveira} et al., Comput. Oper. Res. 135, Article ID 105359, 19 p. (2021; Zbl 07486229) Full Text: DOI Link OpenURL
Haddadi, Salim Iterated local search for consecutive block minimization. (English) Zbl 07485279 Comput. Oper. Res. 131, Article ID 105273, 11 p. (2021). MSC: 90Bxx 90C27 90C59 PDF BibTeX XML Cite \textit{S. Haddadi}, Comput. Oper. Res. 131, Article ID 105273, 11 p. (2021; Zbl 07485279) Full Text: DOI OpenURL
Mosayebi, Mohsen; Sodhi, Manbir; Wettergren, Thomas A. The traveling salesman problem with job-times (TSPJ). (English) Zbl 07485244 Comput. Oper. Res. 129, Article ID 105226, 13 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Mosayebi} et al., Comput. Oper. Res. 129, Article ID 105226, 13 p. (2021; Zbl 07485244) Full Text: DOI OpenURL
Boyacı, Burak; Dang, Thu Huong; Letchford, Adam N. Vehicle routing on road networks: how good is Euclidean approximation? (English) Zbl 07485234 Comput. Oper. Res. 129, Article ID 105197, 14 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{B. Boyacı} et al., Comput. Oper. Res. 129, Article ID 105197, 14 p. (2021; Zbl 07485234) Full Text: DOI OpenURL
Pina-Pardo, Juan C.; Silva, Daniel F.; Smith, Alice E. The traveling salesman problem with release dates and drone resupply. (English) Zbl 07485226 Comput. Oper. Res. 129, Article ID 105170, 18 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. C. Pina-Pardo} et al., Comput. Oper. Res. 129, Article ID 105170, 18 p. (2021; Zbl 07485226) Full Text: DOI OpenURL
Tolsa, Xavier Rectifiability, square functions and Carleson’s \(\varepsilon^2\) conjecture. (Catalan. English summary) Zbl 1494.28005 Butll. Soc. Catalana Mat. 36, No. 2, 181-197 (2021). MSC: 28A75 28A78 30C85 PDF BibTeX XML Cite \textit{X. Tolsa}, Butll. Soc. Catalana Mat. 36, No. 2, 181--197 (2021; Zbl 1494.28005) Full Text: DOI OpenURL
An, Hyung-Chan; Kleinberg, Robert; Shmoys, David B. Approximation algorithms for the bottleneck asymmetric traveling salesman problem. (English) Zbl 07479305 ACM Trans. Algorithms 17, No. 4, Article No. 35, 12 p. (2021). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{H.-C. An} et al., ACM Trans. Algorithms 17, No. 4, Article No. 35, 12 p. (2021; Zbl 07479305) Full Text: DOI arXiv OpenURL
Nejma, Ibtissem Ben; M’Hallah, Rym A beam search for the equality generalized symmetric traveling salesman problem. (English) Zbl 1485.90117 RAIRO, Oper. Res. 55, No. 5, 3021-3039 (2021). MSC: 90C27 90B06 90B10 90C06 90C08 90C59 PDF BibTeX XML Cite \textit{I. B. Nejma} and \textit{R. M'Hallah}, RAIRO, Oper. Res. 55, No. 5, 3021--3039 (2021; Zbl 1485.90117) Full Text: DOI OpenURL
Mitsche, Dieter; Penrose, Mathew D. Limit theory of combinatorial optimization for random geometric graphs. (English) Zbl 1482.05313 Ann. Appl. Probab. 31, No. 6, 2721-2771 (2021). MSC: 05C80 60D05 60F15 90C27 90C35 60G55 PDF BibTeX XML Cite \textit{D. Mitsche} and \textit{M. D. Penrose}, Ann. Appl. Probab. 31, No. 6, 2721--2771 (2021; Zbl 1482.05313) Full Text: DOI arXiv OpenURL
Carr, Robert D.; Simonetti, Neil A new integer programming formulation of the graphical traveling salesman problem. (English) Zbl 1483.90132 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 458-472 (2021). MSC: 90C27 90C10 PDF BibTeX XML Cite \textit{R. D. Carr} and \textit{N. Simonetti}, Lect. Notes Comput. Sci. 12707, 458--472 (2021; Zbl 1483.90132) Full Text: DOI arXiv OpenURL
Cheikhrouhou, Omar; Khoufi, Ines A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. (English) Zbl 1487.90545 Comput. Sci. Rev. 40, Article ID 100369, 19 p. (2021). MSC: 90C27 90-02 PDF BibTeX XML Cite \textit{O. Cheikhrouhou} and \textit{I. Khoufi}, Comput. Sci. Rev. 40, Article ID 100369, 19 p. (2021; Zbl 1487.90545) Full Text: DOI arXiv OpenURL
Traub, Vera; Vygen, Jens; Zenklusen, Rico Reducing path TSP to TSP. (English) Zbl 07430748 SIAM J. Comput. 51, No. 3, STOC20-24-STOC20-53 (2022). MSC: 68W25 05C85 PDF BibTeX XML Cite \textit{V. Traub} et al., SIAM J. Comput. 51, No. 3, STOC20--24-STOC20--53 (2021; Zbl 07430748) Full Text: DOI OpenURL
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
Su, Fuyong; Kong, Linglu; Wang, Hui; Wen, Zhi Modeling and application for rolling scheduling problem based on TSP. (English) Zbl 07424202 Appl. Math. Comput. 407, Article ID 126333, 13 p. (2021). MSC: 90Bxx 90Cxx PDF BibTeX XML Cite \textit{F. Su} et al., Appl. Math. Comput. 407, Article ID 126333, 13 p. (2021; Zbl 07424202) Full Text: DOI OpenURL
Yu, Wei; Liu, Zhaohui; Bao, Xiaoguang Approximation algorithms for some min-max postmen cover problems. (English) Zbl 1480.90216 Ann. Oper. Res. 300, No. 1, 267-287 (2021). MSC: 90C27 90C47 90C59 PDF BibTeX XML Cite \textit{W. Yu} et al., Ann. Oper. Res. 300, No. 1, 267--287 (2021; Zbl 1480.90216) Full Text: DOI OpenURL
Azzam, Jonas; Villa, Michele Quantitative comparisons of multiscale geometric properties. (English) Zbl 1484.28001 Anal. PDE 14, No. 6, 1873-1904 (2021). Reviewer: K. P. Hart (Delft) MSC: 28A12 28A75 28A78 PDF BibTeX XML Cite \textit{J. Azzam} and \textit{M. Villa}, Anal. PDE 14, No. 6, 1873--1904 (2021; Zbl 1484.28001) Full Text: DOI arXiv OpenURL
Bao, Xiaoguang; Lu, Chao; Huang, Dongmei; Yu, Wei Approximation algorithm for min-max cycle cover problem on a mixed graph. (Chinese. English summary) Zbl 1488.90243 Oper. Res. Trans. 25, No. 1, 107-113 (2021). MSC: 90C59 90C47 90C35 PDF BibTeX XML Cite \textit{X. Bao} et al., Oper. Res. Trans. 25, No. 1, 107--113 (2021; Zbl 1488.90243) Full Text: DOI OpenURL
Jacquelin, Mathias; Ng, Esmond G.; Peyton, Barry W. Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes. (English) Zbl 1477.90118 SIAM J. Matrix Anal. Appl. 42, No. 3, 1337-1364 (2021). MSC: 90C35 90C27 05C50 65F05 PDF BibTeX XML Cite \textit{M. Jacquelin} et al., SIAM J. Matrix Anal. Appl. 42, No. 3, 1337--1364 (2021; Zbl 1477.90118) Full Text: DOI OpenURL
Goering, Max; Mccurdy, Sean Wild examples of countably rectifiable sets. (English) Zbl 1479.28001 Ann. Fenn. Math. 46, No. 1, 553-570 (2021). MSC: 28A75 28A78 28A80 54F50 PDF BibTeX XML Cite \textit{M. Goering} and \textit{S. Mccurdy}, Ann. Fenn. Math. 46, No. 1, 553--570 (2021; Zbl 1479.28001) Full Text: DOI arXiv OpenURL
Guajardo, Hector M.; Valdez, Fevrier Optimization of routes of a robot using bioinspired algorithms. (English) Zbl 1469.93069 Melin, Patricia (ed.) et al., Recent advances of hybrid intelligent systems based on soft computing. Cham: Springer. Stud. Comput. Intell. 915, 217-228 (2021). MSC: 93C42 93C85 90C59 PDF BibTeX XML Cite \textit{H. M. Guajardo} and \textit{F. Valdez}, Stud. Comput. Intell. 915, 217--228 (2021; Zbl 1469.93069) Full Text: DOI OpenURL
Lacroix, Mathieu; Ríos-Solís, Yasmín A.; Calvo, Roberto Wolfler Efficient formulations for the traveling car renter problem and its quota variant. (English) Zbl 1475.90083 Optim. Lett. 15, No. 6, 1905-1930 (2021). MSC: 90C27 90C10 90B06 PDF BibTeX XML Cite \textit{M. Lacroix} et al., Optim. Lett. 15, No. 6, 1905--1930 (2021; Zbl 1475.90083) Full Text: DOI OpenURL
Liu, Henan; Zhang, Huili; Xu, Yi The \(m\)-Steiner traveling salesman problem with online edge blockages. (English) Zbl 1473.90142 J. Comb. Optim. 41, No. 4, 844-860 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{H. Liu} et al., J. Comb. Optim. 41, No. 4, 844--860 (2021; Zbl 1473.90142) Full Text: DOI OpenURL
Carrabs, Francesco; Cerulli, Raffaele; Raiconi, Andrea A reduction heuristic for the all-colors shortest path problem. (English) Zbl 1472.90108 RAIRO, Oper. Res. 55, Suppl., S2071-S2082 (2021). MSC: 90C27 90C59 05C38 PDF BibTeX XML Cite \textit{F. Carrabs} et al., RAIRO, Oper. Res. 55, S2071--S2082 (2021; Zbl 1472.90108) Full Text: DOI OpenURL
Dias, Sávio S.; Simonetti, Luidi G.; Ochi, Luiz Satoru An ILS-based heuristic applied to the car renter salesman problem. (English) Zbl 1472.90110 RAIRO, Oper. Res. 55, Suppl., S1725-S1746 (2021). MSC: 90C27 90C11 90C59 90B06 PDF BibTeX XML Cite \textit{S. S. Dias} et al., RAIRO, Oper. Res. 55, S1725--S1746 (2021; Zbl 1472.90110) Full Text: DOI OpenURL
Clímaco, Glaubos; Simonetti, Luidi; Rosseti, Isabel A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem. (English) Zbl 1472.90109 RAIRO, Oper. Res. 55, Suppl., S719-S726 (2021). MSC: 90C27 90C10 90C11 90C08 90C05 PDF BibTeX XML Cite \textit{G. Clímaco} et al., RAIRO, Oper. Res. 55, S719--S726 (2021; Zbl 1472.90109) Full Text: DOI OpenURL
Chen, Kesheng; Xian, Sidong; Guo, Peng Adaptive temperature rising simulated annealing algorithm for traveling salesman problem. (Chinese. English summary) Zbl 1474.90372 Control Theory Appl. 38, No. 2, 245-254 (2021). MSC: 90C27 90C59 90C26 PDF BibTeX XML Cite \textit{K. Chen} et al., Control Theory Appl. 38, No. 2, 245--254 (2021; Zbl 1474.90372) Full Text: DOI OpenURL
Alfandari, Laurent; Toulouse, Sophie Approximation of the double traveling salesman problem with multiple stacks. (English) Zbl 07362199 Theor. Comput. Sci. 877, 74-89 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Alfandari} and \textit{S. Toulouse}, Theor. Comput. Sci. 877, 74--89 (2021; Zbl 07362199) Full Text: DOI arXiv OpenURL
David, Guy C.; Schul, Raanan A sharp necessary condition for rectifiable curves in metric spaces. (English) Zbl 1467.28002 Rev. Mat. Iberoam. 37, No. 3, 1007-1044 (2021). MSC: 28A75 28C15 PDF BibTeX XML Cite \textit{G. C. David} and \textit{R. Schul}, Rev. Mat. Iberoam. 37, No. 3, 1007--1044 (2021; Zbl 1467.28002) Full Text: DOI arXiv OpenURL
Tarhini, Hussein; Maddah, Bacel; Hamzeh, Farook The traveling salesman puts-on a hard hat – tower crane scheduling in construction projects. (English) Zbl 1487.90330 Eur. J. Oper. Res. 292, No. 1, 327-338 (2021). MSC: 90B35 90C10 90C35 PDF BibTeX XML Cite \textit{H. Tarhini} et al., Eur. J. Oper. Res. 292, No. 1, 327--338 (2021; Zbl 1487.90330) Full Text: DOI OpenURL
Lera-Romero, Gonzalo; Miranda-Bront, Juan José A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. (English) Zbl 1487.90623 Eur. J. Oper. Res. 289, No. 3, 879-896 (2021). MSC: 90C35 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{G. Lera-Romero} and \textit{J. J. Miranda-Bront}, Eur. J. Oper. Res. 289, No. 3, 879--896 (2021; Zbl 1487.90623) Full Text: DOI OpenURL
Zhan, Yang; Wang, Zizhuo; Wan, Guohua Home service routing and appointment scheduling with stochastic service times. (English) Zbl 1487.90198 Eur. J. Oper. Res. 288, No. 1, 98-110 (2021). MSC: 90B06 90B35 90C15 90C35 PDF BibTeX XML Cite \textit{Y. Zhan} et al., Eur. J. Oper. Res. 288, No. 1, 98--110 (2021; Zbl 1487.90198) Full Text: DOI OpenURL
Vásquez, Sebastián A.; Angulo, Gustavo; Klapp, Mathias A. An exact solution method for the TSP with drone based on decomposition. (English) Zbl 07350526 Comput. Oper. Res. 127, Article ID 105127, 12 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{S. A. Vásquez} et al., Comput. Oper. Res. 127, Article ID 105127, 12 p. (2021; Zbl 07350526) Full Text: DOI OpenURL
Tan, Xuehou The touring rays and related problems. (English) Zbl 1480.68017 Theor. Comput. Sci. 866, 43-55 (2021). MSC: 68U05 PDF BibTeX XML Cite \textit{X. Tan}, Theor. Comput. Sci. 866, 43--55 (2021; Zbl 1480.68017) Full Text: DOI OpenURL
Sabry, Gustavo de Araujo; Goldbarg, Marco Cesar; Goldbarg, Elizabeth Ferreira Gouvêa; Menezes, Matheus da Silva; Calheiros, Zailton Sachas Amorim Models and linearizations for the Traveling Car Renter with passengers. (English) Zbl 1460.90158 Optim. Lett. 15, No. 1, 59-81 (2021). MSC: 90C27 90C11 90B06 PDF BibTeX XML Cite \textit{G. de A. Sabry} et al., Optim. Lett. 15, No. 1, 59--81 (2021; Zbl 1460.90158) Full Text: DOI OpenURL
Letchford, Adam N.; Vu, Anh N. Facets from gadgets. (English) Zbl 1458.90640 Math. Program. 185, No. 1-2 (A), 297-314 (2021). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. N. Letchford} and \textit{A. N. Vu}, Math. Program. 185, No. 1--2 (A), 297--314 (2021; Zbl 1458.90640) Full Text: DOI Link OpenURL
Zhong, Xianghui On the approximation ratio of the \(k\)-opt and Lin-Kernighan algorithm for metric and graph TSP. (English) Zbl 07651222 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 83, 13 p. (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{X. Zhong}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 83, 13 p. (2020; Zbl 07651222) Full Text: DOI arXiv OpenURL
Kowalik, Łukasz; Li, Shaohua; Nadara, Wojciech; Smulewicz, Marcin; Wahlström, Magnus Many visits TSP revisited. (English) Zbl 07651205 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 66, 22 p. (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{Ł. Kowalik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 66, 22 p. (2020; Zbl 07651205) Full Text: DOI OpenURL
Khachay, Michael; Kudriavtsev, Andrei; Petunin, Alexander PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem. (English) Zbl 07645987 Olenev, Nicholas (ed.) et al., Optimization and applications. 11th international conference, OPTIMA 2020, Moscow, Russia, September 28 – October 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12422, 196-208 (2020). MSC: 90Cxx 49-XX 91-XX 93-XX PDF BibTeX XML Cite \textit{M. Khachay} et al., Lect. Notes Comput. Sci. 12422, 196--208 (2020; Zbl 07645987) Full Text: DOI OpenURL
Maksimenko, A. N. Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm. (Russian. English summary) Zbl 07643290 Model. Anal. Inf. Sist. 27, No. 1, 72-85 (2020). MSC: 90C57 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, Model. Anal. Inf. Sist. 27, No. 1, 72--85 (2020; Zbl 07643290) Full Text: DOI arXiv MNR OpenURL
Mercier-Aubin, Alexandre; Gaudreault, Jonathan; Quimper, Claude-Guy Leveraging constraint scheduling: a case study to the textile industry. (English) Zbl 07636029 Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 334-346 (2020). MSC: 68T20 90Bxx 90C27 PDF BibTeX XML Cite \textit{A. Mercier-Aubin} et al., Lect. Notes Comput. Sci. 12296, 334--346 (2020; Zbl 07636029) Full Text: DOI OpenURL
Svensson, Ola; Tarnawski, Jakub; Végh, László A. A constant-factor approximation algorithm for the asymmetric traveling salesman problem. (English) Zbl 1499.68407 J. ACM 67, No. 6, Paper No. 37, 53 p. (2020). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{O. Svensson} et al., J. ACM 67, No. 6, Paper No. 37, 53 p. (2020; Zbl 1499.68407) Full Text: DOI OpenURL
Hassoun, Michael; Shoval, Shraga; Simchon, Eran; Yedidsion, Liron The single line moving target traveling salesman problem with release times. (English) Zbl 1496.90077 Ann. Oper. Res. 289, No. 2, 449-458 (2020). MSC: 90C27 90C39 PDF BibTeX XML Cite \textit{M. Hassoun} et al., Ann. Oper. Res. 289, No. 2, 449--458 (2020; Zbl 1496.90077) Full Text: DOI OpenURL
Dell’Amico, Mauro; Montemanni, Roberto; Novellani, Stefano Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. (English) Zbl 1496.90072 Ann. Oper. Res. 289, No. 2, 211-226 (2020). MSC: 90C27 90C11 90C59 PDF BibTeX XML Cite \textit{M. Dell'Amico} et al., Ann. Oper. Res. 289, No. 2, 211--226 (2020; Zbl 1496.90072) Full Text: DOI arXiv OpenURL
Puljić, Krunoslav; Manger, Robert Evolutionary operators for the Hamiltonian completion problem. (English) Zbl 1491.90176 Soft Comput. 24, No. 23, 18073-18088 (2020). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{K. Puljić} and \textit{R. Manger}, Soft Comput. 24, No. 23, 18073--18088 (2020; Zbl 1491.90176) Full Text: DOI OpenURL
Glebov, Alekseĭ Nikolaevich; Toktokhoeva, Surèna Garmazhapovna A polynomial algorithm with asymptotic ratio \(2/3\) for the asymmetric maximization version of the \(m\)-PSP. (Russian. English summary) Zbl 1495.90152 Diskretn. Anal. Issled. Oper. 27, No. 3, 28-52 (2020). MSC: 90C27 68W25 68W40 90C35 90C59 PDF BibTeX XML Cite \textit{A. N. Glebov} and \textit{S. G. Toktokhoeva}, Diskretn. Anal. Issled. Oper. 27, No. 3, 28--52 (2020; Zbl 1495.90152) Full Text: DOI MNR OpenURL
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard Fine-grained complexity analysis of two classic TSP variants. (English) Zbl 07471490 ACM Trans. Algorithms 17, No. 1, Article No. 5, 29 p. (2021). MSC: 68Q25 90C27 90C59 PDF BibTeX XML Cite \textit{M. de Berg} et al., ACM Trans. Algorithms 17, No. 1, Article No. 5, 29 p. (2020; Zbl 07471490) Full Text: DOI Link OpenURL
Jaiyen, Ekkaphon; Leksakul, Komgrit Application of element decomposing method for solving traveling salesman problems. (English) Zbl 1482.90185 Thai J. Math. 18, No. 4, 1715-1731 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{E. Jaiyen} and \textit{K. Leksakul}, Thai J. Math. 18, No. 4, 1715--1731 (2020; Zbl 1482.90185) Full Text: Link OpenURL
Regler, Anita Data-driven integrated production and maintenance optimization. (English) Zbl 1471.90062 Neufeld, Janis S. (ed.) et al., Operations research proceedings 2019. Selected papers of the annual international conference of the German Operations Research Society (GOR), Dresden, Germany, September 4–6, 2019. Cham: Springer. Oper. Res. Proc., 43-49 (2020). MSC: 90B25 90B30 90C59 90C11 90C05 PDF BibTeX XML Cite \textit{A. Regler}, Oper. Res. Proc. 2019, 43--49 (2020; Zbl 1471.90062) Full Text: DOI OpenURL
Wang, Yong; Han, Zunpu The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem. (English) Zbl 1470.90109 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 513-524 (2020). MSC: 90C27 05C45 90C35 PDF BibTeX XML Cite \textit{Y. Wang} and \textit{Z. Han}, Lect. Notes Comput. Sci. 12290, 513--524 (2020; Zbl 1470.90109) Full Text: DOI OpenURL
Chan, T.-H. Hubert; Jiang, Haotian; Jiang, Shaofeng H.-C. A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics. (English) Zbl 1484.68331 ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020). MSC: 68W25 68R10 68W20 90C27 PDF BibTeX XML Cite \textit{T. H. H. Chan} et al., ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020; Zbl 1484.68331) Full Text: DOI Link OpenURL
Traub, Vera Improving on best-of-many-Christofides for \(T\)-tours. (English) Zbl 07331208 Oper. Res. Lett. 48, No. 6, 798-804 (2020). MSC: 90-XX PDF BibTeX XML Cite \textit{V. Traub}, Oper. Res. Lett. 48, No. 6, 798--804 (2020; Zbl 07331208) Full Text: DOI arXiv OpenURL
Zhong, Xianghui Slightly improved upper bound on the integrality ratio for the \(s - t\) path TSP. (English) Zbl 1479.90183 Oper. Res. Lett. 48, No. 5, 627-629 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{X. Zhong}, Oper. Res. Lett. 48, No. 5, 627--629 (2020; Zbl 1479.90183) Full Text: DOI arXiv OpenURL
Hougardy, Stefan; Zaiser, Fabian; Zhong, Xianghui The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem. (English) Zbl 1479.90175 Oper. Res. Lett. 48, No. 4, 401-404 (2020). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{S. Hougardy} et al., Oper. Res. Lett. 48, No. 4, 401--404 (2020; Zbl 1479.90175) Full Text: DOI arXiv OpenURL