On single courier problem

DOI10.1007/S11590-008-0079-4zbMath1151.90396OpenAlexW2076541251MaRDI QIDQ941049

Malay Bhattacharyya, Anup Kumar Bandyopadhyay

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0079-4

zbMATH Keywords

traveling salesman problemoptimality principlecourier problemssingle courier problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete optimization in public rail transport
• Approximation schemes for NP-hard geometric optimization problems: a survey
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: On single courier problem