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