Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem

DOI10.1016/j.ejor.2003.09.024zbMath1067.90136OpenAlexW2025661878MaRDI QIDQ704117

Frédéric Semet, Gilbert Laporte, Éric Duchenne

Publication date: 12 January 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.024

zbMATH Keywords

Branch-and-cutPeripatetic Salesman ProblemTraveling Salesman Problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (8)

Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph ⋮ Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique ⋮ Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• On the generalized 2-peripatetic salesman problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• A heuristic approach to the overnight security service problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Lower bounds for symmetricK-peripatetic salesman problems

This page was built for publication: Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem