Convex Combinatorial Optimization
classification
🧮 math.CO
cs.DMmath.OC
keywords
combinatorialoptimizationconvexproblemapplicationsdiscussedge-guaranteedfamily
read the original abstract
We 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.