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 Tag Display
Catalogue Tag Display
MARC 21
Polytopes — Combinatorics and Computation
Tag
Description
020
$a9783034884389
082
$a516.35
099
$aOnline resource: Birkhäuser
245
$aPolytopes — Combinatorics and Computation$h[EBook]$cedited by Gil Kalai, Günter M. Ziegler.
260
$aBasel$bBirkhäuser$c2000.
300
$aVI, 225 pages: 14 illus.$bonline resource.
336
$atext
338
$aonline resource
440
$aDMV Seminar ;$v29
505
$a
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.
520
$a
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.
538
$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700
$aKalai, Gil.$eeditor.
700
$aZiegler, Günter M.$d1963-$eeditor.
710
$aSpringerLink (Online service)
830
$aDMV Seminar ;$v29
856
$u
http://dx.doi.org/10.1007/978-3-0348-8438-9
Quick Search
Search for