Lower bounds for symmetricK-peripatetic salesman problems

From MaRDI portal
Publication:5749147

DOI10.1080/02331939108843650zbMath0717.90048OpenAlexW1963919276MaRDI QIDQ5749147

Jeroen B. J. M. De Kort

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843650




Related Items (21)

On the generalized 2-peripatetic salesman problemEfficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graphApproximability of the minimum-weight \(k\)-size cycle cover problemMulti-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on servicesA polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSPBounds for the symmetric 2-peripatetic salesman problemLower and upper bounds for the \(m\)-peripatetic vehicle routing problemAsymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSPAn asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distributionOn the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean spaceEfficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graphA polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graphCombinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graphThe undirected \(m\)-capacitated peripatetic salesman problemBranch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman ProblemA 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman ProblemHeuristiques pour le Problème du Vendeurm-PéripatétiqueA Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSPApproximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2A branch and bound algorithm for symmetric 2-peripatetic salesman problemsA polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem



Cites Work


This page was built for publication: Lower bounds for symmetricK-peripatetic salesman problems