A travelling salesman problem (TSP) with multiple job facilities.

DOI10.1007/BF03398645zbMath1278.90414OpenAlexW2773469893MaRDI QIDQ2467832

Shila Das, Nazimuddin Ahmed

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

The problem of maximum flow with minimum attainable cost in a network

Cites Work

• Unnamed Item
• Unnamed Item
• Travelling purchaser problem
• On the Relation Between the Traveling-Salesman and the Longest-Path Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• An Algorithm for the Traveling Salesman Problem
• The Loading Problem
• On Hamiltonian Circuits

This page was built for publication: A travelling salesman problem (TSP) with multiple job facilities.