Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:4068472

zbMath0309.90059MaRDI QIDQ4068472

Jakob Krarup

Publication date: 1975


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

On the generalized 2-peripatetic salesman problemSensitivity analysis for symmetric 2-peripatetic salesman problemsEfficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graphMetaheuristics for the risk-constrained cash-in-transit vehicle routing problemApproximability of the minimum-weight \(k\)-size cycle cover problemMulti-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on servicesA large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problemA polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSPThe secure time-dependent vehicle routing problem with uncertain demandsSafe and secure vehicle routing: a survey on minimization of risk exposureObtaining approximately optimal and diverse solutions via dispersionBounds for the symmetric 2-peripatetic salesman problemLower and upper bounds for the \(m\)-peripatetic vehicle routing problemAn asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distributionProbabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from aboveEfficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graphA polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graphCombinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graphA linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensionsThe undirected \(m\)-capacitated peripatetic salesman problemBranch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman ProblemA 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman ProblemA risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertaintyThe multiple shortest path problem with path deconflictionHeuristiques pour le Problème du Vendeurm-PéripatétiqueA Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSPApproximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2A branch and bound algorithm for symmetric 2-peripatetic salesman problems




This page was built for publication: