Sensitivity analysis for symmetric 2-peripatetic salesman problems

DOI10.1016/0167-6377(93)90033-DzbMath0771.90093OpenAlexW1988228774MaRDI QIDQ2367396

Jeroen B. J. M. De Kort

Publication date: 10 August 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90033-d

zbMATH Keywords

sensitivity analysistraveling salesmanHamiltonian cyclesspanning treesgreedy approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Heuristiques pour le Problème du Vendeurm-Péripatétique

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
• Bounds for the symmetric 2-peripatetic salesman problem
• Branch-and-Bound Methods: A Survey
• Minimum partition of a matroid into independent subsets

This page was built for publication: Sensitivity analysis for symmetric 2-peripatetic salesman problems