Pages that link to "Item:Q4327897"
From MaRDI portal
The following pages link to Bounds for the symmetric 2-peripatetic salesman problem (Q4327897):
Displaying 12 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← 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)
- Sensitivity analysis for symmetric 2-peripatetic salesman problems (Q2367396) (← 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)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
