The undirected \(m\)-capacitated peripatetic salesman problem

DOI10.1016/j.ejor.2012.07.022zbMath1292.90247OpenAlexW2074323873MaRDI QIDQ2253380

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

Publication date: 27 July 2014

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

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

zbMATH Keywords

capacitytraveling salesman problembranch-and-cutbranch-and-priceperipatetic salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Safe and secure vehicle routing: a survey on minimization of risk exposure, A cash transportation vehicle routing problem with combinations of different cash denominations

Uses Software

• TSPLIB
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
• Loop based facility planning and material handling
• The equity constrained shortest path problem
• 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
• Vehicle scheduling in two-cycle flexible manufacturing systems
• Formulating logical implications in combinatorial optimisation
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• A heuristic approach to the overnight security service problem
• Interior point stabilization for column generation
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
• Solution of a Large-Scale Traveling-Salesman Problem
• Lower bounds for symmetricK-peripatetic salesman problems