Optimal tour planning with specified nodes

DOI10.1051/RO/1984180302031zbMATH Open0559.90090OpenAlexW2506633573MaRDI QIDQ5184697FDOQ5184697

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

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

zbMATH Keywords

algorithmtravelling salesmanshortest circuitspecified nodes

Mathematics Subject Classification ID

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

Cited In (6)

• On Some Generalizations of the Travelling-Salesman Problem
• Models for a Steiner ring network design problem with revenues
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Routing problems: A bibliography
• Title not available (Why is that?)
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case

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)