Login / Signup
A shortest augmenting path algorithm for dense and sparse linear assignment problems.
Roy Jonker
A. Volgenant
Published in:
Computing (1987)
Keyphrases
</>
sparse linear
dynamic programming
learning algorithm
objective function
data analysis
high dimensional
shortest path
convergence rate
randomly generated
sparse matrix
higher order
simulated annealing
linear models