在“SpringerLink电子期刊”中,命中:2,564条,耗时:0.0250192 秒

在所有数据库中总计命中:5,193

10. The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?
刊名:Lecture Notes in Computer Science
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(2564)
题名(566)
关键词(542)
文摘(2376)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.