Convex Combinatorial Optimization

Simple item page
dc.creatorOnn, Shmuel
dc.creatorRothblum, Uriel G.
dc.date2003-09-05
dc.date.accessioned2026-07-07T07:53:03Z
dc.date.available2026-07-07T07:53:03Z
dc.descriptionWe introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several applications.
dc.identifierhttps://arxiv.org/abs/math/0309083
dc.identifierhttp://arxiv.org/abs/math/0309083
dc.identifierDiscrete and Computational Geometry, 32:549--566, 2004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126107
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subjectOptimization and Control
dc.subject05A; 15A; 51M; 52A; 52B; 52C; 68Q; 68R; 68U; 90B; 90C
dc.titleConvex Combinatorial Optimization
dc.typetext

Files

Collections

arXiv