Polytopes - Combinations and ComputationGil Kalai, Günter M. Ziegler Springer Science & Business Media, 2000. gada 1. aug. - 225 lappuses Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs. |
Saturs
Lectures on 01Polytopes | 1 |
a Framework for Analyzing Convex Polytopes | 43 |
Flag Numbers and FLAGTOOL | 75 |
A Census of Flagvectors of 4Polytopes | 105 |
Extremal Properties of 01Polytopes of Dimension 5 | 111 |
A Practical Study | 131 |
Reconstructing a Simple Polytope from its Graph | 155 |
Reconstructing a Nonsimple Polytope from its Graph | 167 |
A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm | 177 |
The Complexity of Yamnitsky and Levins Simplices Algorithm | 199 |
Citi izdevumi - Skatīt visu
Polytopes - Combinations and Computation Gil Kalai,Günter M. Ziegler Ierobežota priekšskatīšana - 2012 |
Bieži izmantoti vārdi un frāzes
0/1-equivalent 2-neighbourly 0/1-polytope acyclic orientation affine algorithm basic feasible solution Billera classes cobasic coefficients column combinatorial complexity conjecture contains convex polytopes coordinates corresponding cross polytope cube cubical polytope cut polytopes CUT(n d-cube d-dimensional 0/1-polytope d-polytope determinant dictionary dimension dual dual graph ellipsoid method equivalent example extreme rays f-vectors face numbers Figure flag numbers flag-vectors FLAGTOOL Fourier-Motzkin elimination full-dimensional g-numbers Geometry given graph hypercubes hyperplane implemented induced subgraph input integer Joswig Kalai Lasserre's Lemma lex-positive basis lexicographic linear inequalities linear program lower bound Math matrix maximal number number of edges number of facets number of vertices obtained optimal pivot poly polyhedra polyhedron polymake polynomial problem Proof properties Proposition quasifacet random recursion regular polytopes result reverse search Schlegel diagrams Section signed decomposition simple polytopes simplex simplices method simplicial polytopes Theorem triangulation upper bound vertex enumeration vertex set volume computation Ziegler zonotopes