Nonlinear Bipartite Matching

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-182103

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.