Back to Search
Start Over
Nonlinear bipartite matching.
- Source :
- Discrete Optimization; Feb2008, Vol. 5 Issue 1, p53-65, 13p
- Publication Year :
- 2008
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 15725286
- Volume :
- 5
- Issue :
- 1
- Database :
- Supplemental Index
- Journal :
- Discrete Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 29382149
- Full Text :
- https://doi.org/10.1016/j.disopt.2007.11.002