Polytopes - Combinations and Computation
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.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Eugenij Gawrilow Michael Joswig
Gil Kalai Peter Kleinschmidt Günter Meisinger
Andrea Höppner Günter M Ziegler
Benno Bieler Andreas Enge Komei Fukuda
Hans Achatz Peter Kleinschmidt
Sven G Bartels
Citi izdevumi - Skatīt visu
0/1-equivalent acyclic orientation affine algorithm bases basic feasible solution basis Bayer Billera 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 denote determinant dictionary dimension dual dual graph ellipsoid method 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 Kalai Lasserre's Lemma lex-min lex-positive 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 set volume computation Ziegler zonotopes