Login / Signup
Efficient Sampling for Bipartite Matching Problems.
Maksims Volkovs
Richard S. Zemel
Published in:
NIPS (2012)
Keyphrases
</>
np hard
np complete
special case
lower bound
knapsack problem
bipartite matching
benchmark problems
genetic algorithm
dynamic programming
multi objective
optimization problems
genetic programming
test problems
efficient solutions
minimum cost flow