On single courier problem

DOI10.1007/S11590-008-0079-4MaRDI QIDQ941049zbMATH OpenOpenAlexFDO

Authors 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

courier problemsoptimality principlesingle courier problemtraveling salesman problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic programming method in the generalized courier problem
• A generalized Courier problem with the cost function depending on the list of tasks
• The delivery man problem on a tree network
• Generalized model of courier with additional restrictions
• The Train Delivery Problem Revisited

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Approximation schemes for NP-hard geometric optimization problems: a survey
• Discrete optimization in public rail transport
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1198942 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• The Traveling Salesman Problem: A Survey
• The traveling-salesman problem and minimum spanning trees: Part II
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

Cited in

(2)

• The One-Terminal TELPAK Problem
• Dynamic programming method in the generalized courier problem

This page was built for publication: On single courier problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941049)