Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Card Display
Catalogue Card Display
RAK
Title: Polytopes — Combinatorics and Computation ([EBook]) / edited by Gil Kalai, Günter M. Ziegler. Dewey Class: 516.35 Added Personal Name: Kalai, Gil. editor. Ziegler, Günter M., 1963- editor. Publication: Basel : Birkhäuser, 2000. Other name(s): SpringerLink (Online service) Physical Details: VI, 225 pages: 14 illus. : online resource. Series: DMV Seminar ;; 29 ISBN: 9783034884389 System details note: Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users) Summary Note: 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.: Contents note: Lectures on 0/l-Polytopes -- polymake: A Framework for Analyzing Convex Polytopes -- Flag Numbers and FLAGTOOL -- A Census of Flag-vectors of 4-Polytopes -- Extremal Properties of 0/1-Polytopes of Dimension 5 -- Exact Volume Computation for Polytopes: A Practical Study -- Reconstructing a Simple Polytope from its Graph -- Reconstructing a Non-simple Polytope from its Graph -- A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm -- The Complexity of Yamnitsky and Levin’s Simplices Method. ------------------------------ *** There are no holdings for this record *** -----------------------------------------------
Quick Search
Search for