Login / Signup
Finding Optimal Longest Paths by Dynamic Programming in Parallel.
Kai Fieger
Tomás Balyo
Christian Schulz
Dominik Schreiber
Published in:
CoRR (2019)
Keyphrases
</>
finding optimal
dynamic programming
parallel processing
optimal or near optimal
state space
upper bound
linear programming
greedy algorithm
shortest path
single machine
branch and bound algorithm
shared memory