Optimal tour planning with specified nodes

DOI10.1051/ro/1984180302031zbMath0559.90090OpenAlexW2506633573MaRDI QIDQ5184697

Gilbert 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)

Related Items (4)

Generalized travelling salesman problem through n sets of nodes: The asymmetrical case ⋮ Routing problems: A bibliography ⋮ Models for a Steiner ring network design problem with revenues ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem

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