Pages that link to "Item:Q499338"
From MaRDI portal
The following pages link to Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338):
Displaying 4 items.
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms (Q3392127) (← links)
- An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution (Q5374000) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)