Convex Combinatorial Optimization (English)

In: Discrete & Computational Geometry   ;  32 ,  4  ;  549-566  ;  2004

How to get this document?

Free access

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.

Table of contents – Volume 32, Issue 4

Show all volumes and issues

The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.

435
Guest Editors#8217 Preface
Bayer, Margaret M. / Lee, Carl W. / Sturmfels, Bernd | 2004
435
Guest Editors’ Preface
Bayer, Margaret M. / Lee, Carl W. / Sturmfels, Bernd | 2004
437
The Partial-Fractions Method for Counting Solutions to Integral Linear Systems
Beck, Matthias | 2004
447
Isoradial Bodies
Brandenberg, René / Dattasharma, Abhi / Gritzmann, Peter / Larman, David | 2004
459
Vertices of Gelfand--Tsetlin Polytopes
Loera, Jesús A. / McAllister, Tyrrell B. | 2004
471
A Complexity Bound on Faces of the Hull Complex
Develin, Mike | 2004
481
Enumerative Properties of Ferrers Graphs
Ehrenborg, Richard / Willigenburg, Stephanie | 2004
493
Tchebyshev Posets
Hetyei, Gábor | 2004
521
Mixed Fibre Polytopes
McMullen, Peter | 2004
533
Inequalities for the h-Vectors and Flag h-Vectors of Geometric Lattices
Nyman, Kathryn / Swartz, Ed | 2004
549
Convex Combinatorial Optimization
Onn, Shmuel / Rothblum, Uriel G. | 2004
567
Non-Crossing Frameworks with Non-Crossing Reciprocals
Orden, David / Rote, Günter / Santos, Francisco / Servatius, Brigitte / Servatius, Herman / Whiteley, Walter | 2004
601
The Et-Construction for Lattices, Spheres and Polytopes
Paffenholz, Andreas / Ziegler, Günter M. | 2004
623
Graphs, Syzygies, and Multivariate Splines
Rose, Lauren L. | 2004