Pages that link to "Item:Q704117"
From MaRDI portal
The following pages link to Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117):
Displaying 7 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)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
- Dissimilar arc routing problems (Q6496354) (← links)
