Approximation algorithms for the maximum 2-peripatetic salesman problem

DOI10.1134/S1990478912030040zbMATH Open1324.90133MaRDI QIDQ5263758FDOQ5263758

Authors: Eh. Kh. Gimadi, E. V. Ivonina 

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Recommendations

• Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2
• scientific article
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
• Approximating the metric 2-peripatetic salesman problem

zbMATH Keywords

traveling salesman problempolynomial algorithmguaranteed approximation ratio2-peripatetic salesman problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited In (15)

• A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP
• Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2
• An approximation algorithm for the minimum 2-peripatetic salesman problem with different weight functions
• A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP
• On the generalized 2-peripatetic salesman problem
• Title not available (Why is that?)
• The undirected \(m\)-capacitated peripatetic salesman problem
• Sensitivity analysis for symmetric 2-peripatetic salesman problems
• A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
• Title not available (Why is that?)
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
• Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
• Safe and secure vehicle routing: a survey on minimization of risk exposure
• An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution

This page was built for publication: Approximation algorithms for the maximum 2-peripatetic salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263758)