Determining time-dependent minimum cost paths under several objectives

标题
Determining time-dependent minimum cost paths under several objectives
作者
关键词
Time-dependent networks, Congestion, Emission, Quickest path, Bounds, Label-setting algorithm, Link travel time, Flow speed model
出版物
COMPUTERS & OPERATIONS RESEARCH
Volume -, Issue -, Pages -
出版商
Elsevier BV
发表日期
2019-01-17
DOI
10.1016/j.cor.2019.01.007

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

Reprint

联系作者

Find the ideal target journal for your manuscript

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

Search

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