Time‐dependent traveling salesman problem–the deliveryman case

Publisher Website

1 October 1990

journal article
research article
Published by Wiley in Networks

Vol. 20 (6) , 753-763
https://doi.org/10.1002/net.3230200605

Abstract

No abstract available

Keywords

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 7 references indexed in Scilit:

The complexity of the travelling repairman problem
RAIRO - Theoretical Informatics and Applications, 1986
Algorithm for the solution of the assignment problem for sparse matrices
Computing, 1983
State‐space relaxation procedures for the computation of bounds to routing problems
Networks, 1981
Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
Operations Research, 1980
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
Operations Research, 1978
Validation of subgradient optimization
Mathematical Programming, 1974
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Operations Research, 1973