Nonlinear Bipartite Matching
<|reference_start|>Nonlinear Bipartite Matching: 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.<|reference_end|>
@article{berstein2006nonlinear,
    title={Nonlinear Bipartite Matching},
    author={Yael Berstein and Shmuel Onn},
    journal={Discrete Optimization, 5:53--65, 2008},
    year={2006},
    archivePrefix={arXiv},
    eprint={math/0605610},
    primaryClass={math.OC cs.CC cs.DM math.CO}
}