Convex Combinatorial Optimization
<|reference_start|>Convex Combinatorial Optimization: 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.<|reference_end|>
@article{onn2003convex,
    title={Convex Combinatorial Optimization},
    author={Shmuel Onn and Uriel G. Rothblum},
    journal={Discrete and Computational Geometry, 32:549--566, 2004},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0309083},
    primaryClass={math.CO cs.DM math.OC}
}