Dynamic programming and the graphical traveling salesman problem

DOI10.1145/174147.169803zbMath0795.68174OpenAlexW1977852789MaRDI QIDQ4285636

Armand Nachef, Jean Fonlupt

Publication date: 24 March 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174147.169803

zbMATH Keywords

dynamic programmingcombinatorial optimizationtraveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

The Steiner traveling salesman problem with online edge blockages ⋮ A partitioning column approach for solving LED sorter manipulator path planning problems ⋮ Optimally solving the joint order batching and picker routing problem ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ The traveling salesman problem in graphs with some excluded minors ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs ⋮ New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

This page was built for publication: Dynamic programming and the graphical traveling salesman problem