Nonlinear Bipartite Matching

Simple item page
dc.creatorBerstein, Yael
dc.creatorOnn, Shmuel
dc.date2006-05-23
dc.date.accessioned2026-07-07T09:52:26Z
dc.date.available2026-07-07T09:52:26Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0605610
dc.identifierhttp://arxiv.org/abs/math/0605610
dc.identifierDiscrete Optimization, 5:53--65, 2008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165593
dc.subjectOptimization and Control
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subject05A; 15A; 51M; 52A; 52B; 52C; 68Q; 68R; 68U; 90B; 90C
dc.titleNonlinear Bipartite Matching
dc.typetext

Files

Collections

arXiv