## Convex Combinatorial Optimization (2004)

by
Shmuel Onn
,
Uriel G. Rothblum

Venue: | DISCRETE & COMPUTATIONAL GEOMETRY |

Citations: | 13 - 7 self |

### BibTeX

@MISC{Onn04convexcombinatorial,

author = {Shmuel Onn and Uriel G. Rothblum},

title = { Convex Combinatorial Optimization },

year = {2004}

}

### OpenURL

### 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.