Pages that link to "Item:Q1868811"
From MaRDI portal
The following pages link to A heuristic approach to the overnight security service problem (Q1868811):
Displaying 29 items.
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← 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)
- 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 large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
- Vehicle routing with arrival time diversification (Q1711450) (← links)
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
- The multiple shortest path problem with path deconfliction (Q2030451) (← links)
- The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- The secure time-dependent vehicle routing problem with uncertain demands (Q2668686) (← links)
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector (Q2968486) (← links)
- Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← 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 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)
- Finding shortest and dissimilar paths (Q6071084) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
- A cash transportation vehicle routing problem with combinations of different cash denominations (Q6088203) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
- Dissimilar arc routing problems (Q6496354) (← links)
