Pages that link to "Item:Q3392127"
From MaRDI portal
The following pages link to The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms (Q3392127):
Displaying 9 items.
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← 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)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
- A cash transportation vehicle routing problem with combinations of different cash denominations (Q6088203) (← links)
