Convex Combinatorial Optimization
Combinatorics
2007-05-23 v1 Discrete Mathematics
Optimization and Control
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.
Cite
@article{arxiv.math/0309083,
title = {Convex Combinatorial Optimization},
author = {Shmuel Onn and Uriel G. Rothblum},
journal= {arXiv preprint arXiv:math/0309083},
year = {2007}
}