Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem

Published 2012 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem
Authors
Keywords
-
Journal
TRANSPORTATION SCIENCE
Volume 48, Issue 1, Pages 46-58
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Online
2012-12-14
DOI
10.1287/trsc.1120.0449

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.