Beating Greedy for Stochastic Bipartite Matching.

Buddhima Gamlath Sagar Kale Ola Svensson

Published in: CoRR (2019)

Keyphrases

bipartite matching
maximum weight
minimum cost flow
greedy algorithm
search algorithm
locally optimal
search space
bayesian networks
computational complexity
evolutionary algorithm
multi objective
dynamic programming
scheduling problem
weighted graph
greedy heuristic