Nonlinear bipartite matching

@article{Berstein2008NonlinearBM,
  title={Nonlinear bipartite matching},
  author={Yael Berstein and S. Onn},
  journal={Discret. Optim.},
  year={2008},
  volume={5},
  pages={53-65}
}
  • Yael Berstein, S. Onn
  • Published 2008
  • Computer Science, Mathematics
  • Discret. Optim.
  • 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. 
    Nonlinear Matroid Optimization and Experimental Design
    • 30
    • Open Access
    Approximate Nonlinear Optimization over Weighted Independence Systems
    • 13
    • Open Access
    Concentration inequalities for nonlinear matroid intersection
    • 2
    • Open Access
    Nonlinear Optimization over a Weighted Independence System
    • 10
    • Open Access
    On the complexity of nonlinear mixed-integer optimization
    • 12
    • Open Access
    On the Complexity of Nonlinear Mixed-Integer Optimization
    • 28
    • Open Access
    Optimization of Dynamic Matching Models
    • 4
    • Open Access
    Nonlinear optimization for matroid intersection and extensions
    • 9
    • Open Access
    Computation in multicriteria matroid optimization
    • 4
    • Open Access
    Parametric nonlinear discrete optimization over well-described sets and matroid intersections
    • 14
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    Convex Matroid Optimization
    • S. Onn
    • Mathematics, Computer Science
    • 2003
    • 22
    • Open Access
    Convex Combinatorial Optimization
    • 56
    • Open Access
    Matching is as easy as matrix inversion
    • 566
    • Open Access
    Matchings in colored bipartite networks
    • 26
    • Open Access
    Some NP-complete problems in linear programming
    • 49
    • Highly Influential
    • Open Access
    The Vector Partition Problem for Convex Objective Functions
    • 45
    • Open Access
    A Polynomial Time Algorithm for Shaped Partition Problems
    • 54
    • Open Access
    Polytopes and Complexity
    • 12
    Fast Probabilistic Algorithms for Verification of Polynomial Identities
    • 1,533
    • Highly Influential
    • Open Access