On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.

DOI10.1023/A:1020963600708zbMath1116.90389OpenAlexW309099924MaRDI QIDQ1778797

Niranjan Chakravarthy

Publication date: 17 June 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020963600708

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (4)

Dynamic programming method in extremal constrained routing problems ⋮ Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem ⋮ An extremal constrained routing problem with internal losses ⋮ On an iterative procedure for solving a routing problem with constraints

This page was built for publication: On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.