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 Display
Catalogue Display
Polytopes — Combinatorics and Computation
.
Bookmark this Record
Catalogue Record 44527
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 44527
.
Reviews
Catalogue Record 44527
.
British Library
Resolver for RSN-44527
Google Scholar
Resolver for RSN-44527
WorldCat
Resolver for RSN-44527
Catalogo Nazionale SBN
Resolver for RSN-44527
GoogleBooks
Resolver for RSN-44527
ICTP Library
Resolver for RSN-44527
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
516.35
Title
Polytopes — Combinatorics and Computation ([EBook]) / edited by Gil Kalai, Günter M. Ziegler.
Added Personal Name
Kalai, Gil
Ziegler, Günter M. , 1963-
Other name(s)
SpringerLink (Online service)
Publication
Basel : Birkhäuser , 2000.
Physical Details
VI, 225 pages: 14 illus. : online resource.
Series
DMV Seminar
; 29
ISBN
9783034884389
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.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-3-0348-8438-9
Links to Related Works
Subject References:
Geometry
.
Mathematics
.
Polytopes
.
Authors:
editor
.
Kalai, Gil
.
Ziegler, Günter M. 1963-
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
DMV Seminar
.
Classification:
516.35
.
516.35 (DDC 21)
.
.
ISBD Display
Catalogue Record 44527
.
Tag Display
Catalogue Record 44527
.
Related Works
Catalogue Record 44527
.
Marc XML
Catalogue Record 44527
.
Add Title to Basket
Catalogue Record 44527
.
Catalogue Information 44527
Beginning of record
.
Catalogue Information 44527
Top of page
.
Download Title
Catalogue Record 44527
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
44527
1
44527
-
2
44527
-
3
44527
-
4
44527
-
5
44527
-
Quick Search
Search for