Matching is as easy as matrix inversion
Combinatorica
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
The Vector Partition Problem for Convex Objective Functions
Mathematics of Operations Research
A Polynomial Time Algorithm for Shaped Partition Problems
SIAM Journal on Optimization
Matchings in colored bipartite networks
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
The Complexity of Three-Way Statistical Tables
SIAM Journal on Computing
Some NP-complete problems in linear programming
Operations Research Letters
Nonlinear Optimization over a Weighted Independence System
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Computation in multicriteria matroid optimization
Journal of Experimental Algorithmics (JEA)
Approximate Nonlinear Optimization over Weighted Independence Systems
SIAM Journal on Discrete Mathematics
Concentration inequalities for nonlinear matroid intersection
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the closest string via rank distance
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
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.