Convex Combinatorial Optimization

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Combinatorics, Discrete Mathematics, Optimization and Control, 05A; 15A; 51M; 52A; 52B; 52C; 68Q; 68R; 68U; 90B; 90C

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/126107

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0309083
 http://arxiv.org/abs/math/0309083
 Discrete and Computational Geometry, 32:549--566, 2004

Collections

arXiv