2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/165593We 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.Optimization and ControlComputational ComplexityDiscrete MathematicsCombinatorics05A; 15A; 51M; 52A; 52B; 52C; 68Q; 68R; 68U; 90B; 90Ctext