Nonlinear bipartite matching

DOI10.1016/j.disopt.2007.11.002zbMath1135.91027arXivmath/0605610OpenAlexW2091031872MaRDI QIDQ924630

Yael Berstein, Shmuel Onn

Publication date: 16 May 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0605610

zbMATH Keywords

integer programmingcombinatorial optimizationpermutationpermutation matrixassignment problemstochastic matrixBirkhoff polytope

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Matching models (91B68)

Related Items (5)

Parametric nonlinear discrete optimization over well-described sets and matroid intersections ⋮ Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations ⋮ Nonlinear Optimization over a Weighted Independence System ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Matching is as easy as matrix inversion
• Matchings in colored bipartite networks
• Convex combinatorial optimization
• Some NP-complete problems in linear programming
• The Vector Partition Problem for Convex Objective Functions
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The complexity of restricted spanning tree problems
• Convex Matroid Optimization
• The Complexity of Three-Way Statistical Tables
• A Polynomial Time Algorithm for Shaped Partition Problems

This page was built for publication: Nonlinear bipartite matching