scientific article; zbMATH DE number 3485514

Cited in

(31)

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
A branch and bound algorithm for symmetric 2-peripatetic salesman problems
On the generalized 2-peripatetic salesman problem
A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
The multiple shortest path problem with path deconfliction
The undirected \(m\)-capacitated peripatetic salesman problem
Sensitivity analysis for symmetric 2-peripatetic salesman problems
The secure time-dependent vehicle routing problem with uncertain demands
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
Approximability of the minimum-weight \(k\)-size cycle cover problem
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
Heuristiques pour le Problème du Vendeurm-Péripatétique
Bounds for the symmetric 2-peripatetic salesman problem
Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
A polynomial algorithm with asymptotic ratio 2/3 for the asymmetric maximization version of the m-PSP
An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
Safe and secure vehicle routing: a survey on minimization of risk exposure
Obtaining approximately optimal and diverse solutions via dispersion
Lower and upper bounds for the m-peripatetic vehicle routing problem
Dissimilar arc routing problems
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
On queens and tours
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068472)