"An effective method to find the k shortest paths in a generalized ..."

Xiao-Bing Hu et al. (2016)

> Home

Details and statistics

DOI: 10.1109/CEC.2016.7744078

access: closed

type: Conference or Workshop Paper

metadata version: 2018-04-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cec/HuZLZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/HuZLZ16
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang:
An effective method to find the k shortest paths in a generalized time-window network. CEC 2016: 2345-2351

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.