Polytopes - Combinations and Computation

Лицевая обложка
Gil Kalai, Günter M. Ziegler
Springer Science & Business Media, 1 авг. 2000 г. - Всего страниц: 225
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.

Отзывы - Написать отзыв

Не удалось найти ни одного отзыва.


Lectures on 01Polytopes
a Framework for Analyzing Convex Polytopes
Flag Numbers and FLAGTOOL
A Census of Flagvectors of 4Polytopes
Extremal Properties of 01Polytopes of Dimension 5
A Practical Study
Reconstructing a Simple Polytope from its Graph
Reconstructing a Nonsimple Polytope from its Graph
A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
The Complexity of Yamnitsky and Levins Simplices Algorithm
Авторские права

Другие издания - Просмотреть все

Часто встречающиеся слова и выражения

Библиографические данные