%0 Conference Paper %1 conf/cec/HuZLZ16 %A Hu, Xiao-Bing %A Zhang, Ming-Kong %A Liao, Jian-Qin %A Zhang, Hailin %B CEC %D 2016 %I IEEE %K dblp %P 2345-2351 %T An effective method to find the k shortest paths in a generalized time-window network. %U http://dblp.uni-trier.de/db/conf/cec/cec2016.html#HuZLZ16 %@ 978-1-5090-0623-6

@inproceedings{conf/cec/HuZLZ16, added-at = {2018-04-02T00:00:00.000+0200}, author = {Hu, Xiao-Bing and Zhang, Ming-Kong and Liao, Jian-Qin and Zhang, Hailin}, biburl = {https://www.bibsonomy.org/bibtex/20de654a032c0e07bd534c5ddf4ce1790/dblp}, booktitle = {CEC}, crossref = {conf/cec/2016}, ee = {https://doi.org/10.1109/CEC.2016.7744078}, interhash = {5a05e50f4f54c05004f2640e3933fb06}, intrahash = {0de654a032c0e07bd534c5ddf4ce1790}, isbn = {978-1-5090-0623-6}, keywords = {dblp}, pages = {2345-2351}, publisher = {IEEE}, timestamp = {2019-10-17T15:49:25.000+0200}, title = {An effective method to find the k shortest paths in a generalized time-window network.}, url = {http://dblp.uni-trier.de/db/conf/cec/cec2016.html#HuZLZ16}, year = 2016 }