Login / Signup
Finding the K shortest paths in a time-schedule network with constraints on arcs.
Wen Jin
Shuiping Chen
Hai Jiang
Published in:
Comput. Oper. Res. (2013)
Keyphrases
</>
strongly connected
network model
limited capacity
constraint satisfaction
network architecture
long distance
data sets
wireless sensor networks
mobile robot
scheduling problem
peer to peer
line segments
complex networks
data flow
linear constraints