• English
    • Deutsch
  • English 
    • English
    • Deutsch
  • Login
View Item 
  •   Home
  • 6 - Oberwolfach Seminars (OWS)
  • DMV Seminar
  • View Item
  •   Home
  • 6 - Oberwolfach Seminars (OWS)
  • DMV Seminar
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Polytopes - combinatorics and computation

Thumbnail
Date
2000
Series
DMV Seminar;Vol. 29
Author
Kalai, Gil
Ziegler, Günter M.
Metadata
Show full item record
OWS-29
Abstract
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.
DOI
10.1007/978-3-0348-8438-9
Collections
  • DMV Seminar

Mathematisches Forschungsinstitut Oberwolfach copyright © 2017-2024 
Contact Us | Legal Notice | Data Protection Statement
Leibniz Gemeinschaft
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesWorkshop CodeSubjectsMFO Series IDMSCSnapshot SubjectMFO Scientific ProgramThis CollectionBy Issue DateAuthorsTitlesWorkshop CodeSubjectsMFO Series IDMSCSnapshot SubjectMFO Scientific Program

My Account

Login

Mathematisches Forschungsinstitut Oberwolfach copyright © 2017-2024 
Contact Us | Legal Notice | Data Protection Statement
Leibniz Gemeinschaft