Mathematics – Optimization and Control
Scientific paper
2006-05-23
Discrete Optimization, 5:53--65, 2008
Mathematics
Optimization and Control
Scientific paper
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.
Berstein Yael
Onn Shmuel
No associations
LandOfFree
Nonlinear Bipartite Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nonlinear Bipartite Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonlinear Bipartite Matching will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-182103