Optimizing over a slice of the bipartite matching polytope.

Matthias Leclerc

Published in: Discret. Math. (1989)

Keyphrases

bipartite matching
maximum weight
minimum cost flow
lattice points
stable set
data points
convex hull
knapsack problem
lower bound