Pages that link to "Item:Q5749147"
From MaRDI portal
The following pages link to Lower bounds for symmetric<i>K</i>-peripatetic salesman problems (Q5749147):
Displaying 23 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
- On the generalized 2-peripatetic salesman problem (Q1328613) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← links)
- Bounds for the symmetric 2-peripatetic salesman problem (Q4327897) (← links)
- A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (Q4973249) (← links)
- A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
- An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution (Q5374000) (← links)
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem (Q5443376) (← links)
- Dissimilar arc routing problems (Q6496354) (← links)
- Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max (Q6587426) (← links)
