On the m-capacitated peripatetic salesman problem with capacity restrictions

DOI10.1134/S1990478914010050zbMATH Open1324.90132OpenAlexW2069141602MaRDI QIDQ5263830FDOQ5263830

Authors: Eh. Kh. Gimadi, A. M. Istomin, I. A. Rykov 

Publication date: 17 July 2015

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

Full work available at URL: https://doi.org/10.1134/s1990478914010050

Recommendations

• On 2-capacitated peripatetic salesman problem with different weight functions
• The undirected \(m\)-capacitated peripatetic salesman problem
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• Approximation algorithms for the maximum 2-peripatetic salesman problem
• Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above

zbMATH Keywords

approximation algorithmtravelling salesman problemperformance guaranteeperipatetic salesman problemedge-disjoint Hamiltonian cycle

Mathematics Subject Classification ID

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

Cited In (3)

• The unit-capacity constrained permutation problem
• The undirected \(m\)-capacitated peripatetic salesman problem
• Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints

This page was built for publication: On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions

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