Nonlinear Bipartite Matching
Optimization and Control
2008-07-24 v1 Computational Complexity
Discrete Mathematics
Combinatorics
Abstract
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.
Cite
@article{arxiv.math/0605610,
title = {Nonlinear Bipartite Matching},
author = {Yael Berstein and Shmuel Onn},
journal= {arXiv preprint arXiv:math/0605610},
year = {2008}
}