Optimal tour planning with specified nodes

DOI10.1051/RO/1984180302031MaRDI QIDQ5184697zbMATH OpenOpenAlexFDO

Authors G. Laporte, Hélène Mercure, Yves Nobert

Publication date 1984

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104853

zbMATH Keywords

algorithmtravelling salesmanshortest circuitspecified nodes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Recommendations

• On Some Generalizations of the Travelling-Salesman Problem
• Complexity analysis and optimization of the shortest path tour problem
• Publication:3479820
• scientific article; zbMATH DE number 795217
• scientific article; zbMATH DE number 4053381

Cited in

(6)

• Models for a Steiner ring network design problem with revenues
• On Some Generalizations of the Travelling-Salesman Problem
• scientific article; zbMATH DE number 3847427 (Why is no real title available?)
• Routing problems: A bibliography
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• An efficient composite heuristic for the symmetric generalized traveling salesman problem

This page was built for publication: Optimal tour planning with specified nodes

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