Tabu Search, Partial Elementarity, and Generalizedk-Path Inequalities for the Vehicle Routing Problem with Time Windows

标题
Tabu Search, Partial Elementarity, and Generalizedk-Path Inequalities for the Vehicle Routing Problem with Time Windows
作者
关键词
-
出版物
TRANSPORTATION SCIENCE
Volume 42, Issue 3, Pages 387-404
出版商
Institute for Operations Research and the Management Sciences (INFORMS)
发表日期
2008-04-01
DOI
10.1287/trsc.1070.0223

向作者/读者发起求助以获取更多资源

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

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