The travelling salesman problem with precedence constraints.

DOI10.1007/BF03398638zbMath1278.90412OpenAlexW2772802516MaRDI QIDQ2467824

Zakir Hussain Ahmed, S. N. Narahari Pandit

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398638

Mathematics Subject Classification ID

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

Related Items (2)

A data-guided lexisearch algorithm for the asymmetric traveling salesman problem ⋮ An exact algorithm for the clustered travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lexicographic search for strongly correlated 0-1 knapsack problems
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• An Algorithm for the Traveling Salesman Problem
• The Loading Problem

This page was built for publication: The travelling salesman problem with precedence constraints.