The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
From MaRDI portal
Publication:3392127
DOI10.1287/opre.1070.0387zbMath1167.90627OpenAlexW2015274422MaRDI QIDQ3392127
Gilbert Laporte, Éric Duchenne, Frédéric Semet
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0387
Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ A cash transportation vehicle routing problem with combinations of different cash denominations ⋮ Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique
Uses Software
This page was built for publication: The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
