Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

Title
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
Authors
Keywords
Traveling salesman problem, Time dependence, Time windows, Lower and upper bounds, Branch-and-bound
Journal
DISCRETE APPLIED MATHEMATICS
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2018-11-07
DOI
10.1016/j.dam.2018.09.017

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search