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. © 2007 Elsevier Ltd. All rights reserved.
Berstein, Y., & Onn, S. (2008). Nonlinear bipartite matching. Discrete Optimization, 5(1), 53–65. https://doi.org/10.1016/j.disopt.2007.11.002