Show simple item record

dc.contributor.authorKalai, Gil
dc.contributor.authorZiegler, Günter M.
dc.date.accessioned2016-09-23T15:16:02Z
dc.date.available2016-09-23T15:16:02Z
dc.date.issued2000
dc.identifier.isbn978-3-7643-6351-2
dc.identifier.urihttp://publications.mfo.de/handle/mfo/512
dc.description.abstractQuestions 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.en_US
dc.language.isoen_USen_US
dc.publisherBirkhäuser Baselen_US
dc.relation.ispartofseriesDMV Seminar;Vol. 29
dc.titlePolytopes - combinatorics and computationen_US
dc.typeBooken_US
dc.identifier.doi10.1007/978-3-0348-8438-9
local.series.idOWS-29


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record