The undirected m-capacitated peripatetic salesman problem

DOI10.1016/J.EJOR.2012.07.022MaRDI QIDQ2253380zbMATH OpenOpenAlexFDO

Authors Éric Duchenne, G. Laporte, F. Semet

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

branch-and-cutbranch-and-pricecapacityperipatetic salesman problemtraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions
• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
• Heuristiques pour le Problème du Vendeurm-Péripatétique
• The Capacitated Traveling Salesman Location Problem
• On asymptotically optimal approach to the m-Peripatetic Salesman problem on random inputs
• An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
• Approximation algorithms for the maximum 2-peripatetic salesman problem
• The minimax problem of \(M\)-travelling salesmen
• On 2-capacitated peripatetic salesman problem with different weight functions

Cites work

• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A heuristic approach to the overnight security service problem
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Formulating logical implications in combinatorial optimisation
• scientific article; zbMATH DE number 3943560 (Why is no real title available?)
• scientific article; zbMATH DE number 3485514 (Why is no real title available?)
• Interior point stabilization for column generation
• Loop based facility planning and material handling
• Lower and upper bounds for the m-peripatetic vehicle routing problem
• Lower bounds for symmetricK-peripatetic salesman problems
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• Solution of a Large-Scale Traveling-Salesman Problem
• The equity constrained shortest path problem
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Vehicle scheduling in two-cycle flexible manufacturing systems

Cited in

(10)

• The unit-capacity constrained permutation problem
• The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• Heuristiques pour le Problème du Vendeurm-Péripatétique
• On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions
• On 2-capacitated peripatetic salesman problem with different weight functions
• Safe and secure vehicle routing: a survey on minimization of risk exposure
• A cash transportation vehicle routing problem with combinations of different cash denominations
• Dissimilar arc routing problems
• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem

Describes a project that uses

Uses Software

• TSPLIB
• Concorde

This page was built for publication: The undirected \(m\)-capacitated peripatetic salesman problem

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