×

Found 58 Documents (Results 1–58)

Network optimization on partitioned pairs of points. (English) Zbl 1457.68199

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 6, 12 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A priori TSP in the scenario model. (English) Zbl 1484.90097

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 183-196 (2017).
MSC:  90C27 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Reduction rules for the covering tour problem. (English) Zbl 0984.90016

Szwarcfiter, Jayme (ed.), Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics, Fortaleza, Ceará, Brazil, March 17-19, 2001. Extended abstracts. Amsterdam: Elsevier, Electron. Notes Discrete Math. 7, no pag., electronic only (2001).
MSC:  90B35 05C38 90C05
PDFBibTeX XMLCite

Probabilistic analysis of bipartite traveling salesman problems. (English) Zbl 0984.90049

Szwarcfiter, Jayme (ed.), Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics, Fortaleza, Ceará, Brazil, March 17-19, 2001. Extended abstracts. Amsterdam: Elsevier, Electron. Notes Discrete Math. 7, no pag., electronic only (2001).
MSC:  90C35 05C85 90C27
PDFBibTeX XMLCite

TSP-based curve reconstruction in polynomial time. (English) Zbl 0954.65011

Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 686-695 (2000).
PDFBibTeX XMLCite

The maximum traveling salesman problem under polyhedral norms. (English) Zbl 0910.90259

Bixby, Robert E. (ed.) et al., Integer programming and combinatorial optimization. 6th international IPCO conference, Houston, TX, USA, June 22–24, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1412, 195-201 (1998).
MSC:  90C35 90C60 90C10
PDFBibTeX XMLCite

Asymptotic experimental analysis for the Held-Karp traveling salesman bound. (English) Zbl 0845.90123

Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, held in Atlanta, GA, USA, January 28-30, 1996. Philadelphia, PA: SIAM. 341-350 (1996).
MSC:  90C35
PDFBibTeX XMLCite

Data structures for traveling salesmen. (English) Zbl 0801.68032

Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 145-154 (1993).
MSC:  68P05 68R10 90C27
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software