×

Found 83 Documents (Results 1–83)

Approximation algorithms with constant factors for a series of asymmetric routing problems. (English. Russian original) Zbl 07820602

Dokl. Math. 108, No. 3, 499-505 (2023); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 514, No. 1, 89-97 (2023).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles. (English. Russian original) Zbl 1535.68212

Proc. Steklov Inst. Math. 323, Suppl. 1, S121-S132 (2023); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 29, No. 3, 261-273 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio. (English) Zbl 1528.90221

Olenev, Nicholas (ed.) et al., Optimization and applications. 13th international conference, OPTIMA 2022, Petrovac, Montenegro, September 26–30, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13781, 81-90 (2023).
MSC:  90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Improved approximation algorithm for the asymmetric prize-collecting TSP. (English) Zbl 1522.90159

Ni, Qiufen (ed.) et al., Algorithmic aspects in information and management. 16th international conference, AAIM 2022, Guangzhou, China, August 13–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13513, 28-32 (2022).
PDFBibTeX XMLCite
Full Text: DOI

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 1514.90204

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
PDFBibTeX XMLCite
Full Text: DOI

The asymmetric travelling salesman problem in sparse digraphs. (English) Zbl 07764114

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 23, 18 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A constant-factor approximation algorithm for the asymmetric traveling salesman problem. (English) Zbl 1428.90146

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 204-213 (2018).
MSC:  90C27 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

The uncapacitated asymmetric traveling salesman problem with multiple stacks. (English) Zbl 1370.90205

Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 105-116 (2012).
MSC:  90C27 90C57
PDFBibTeX XMLCite
Full Text: DOI

Data correcting approaches in combinatorial optimization. (English) Zbl 1304.90171

SpringerBriefs in Optimization. New York, NY: Springer (ISBN 978-1-4614-5285-0/pbk; 978-1-4614-5286-7/ebook). x, 114 p. (2012).
PDFBibTeX XMLCite
Full Text: DOI

Simpler approximation of the maximum asymmetric traveling salesman problem. (English) Zbl 1245.68252

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 501-506, electronic only (2012).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Solving TSP through the integration of OR and CP techniques. (English) Zbl 0990.90553

Wallace, Mark (ed.) et al., CP98. Workshop on large scale combinatorial optimisation and constraints. Pisa, Italy, October 30, 1998. Amsterdam: Elsevier, Electron. Notes Discrete Math. 1, 13-25, electronic only (1999).
MSC:  90C27 90C35 90C10
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software