|
The last 15 years have seen significant progress in the development of general purpose algorithms and software for polyhedral computation e.g. finding lattice points, enumerating vertices, extreme rays and facets, and triangulating polyhedra. Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general purpose algorithms. They are, however, highly structured and attention has turned to exploiting this structure, particularly symmetry. Initial applications of this approach have permitted computations previously far out of reach, but much remains to be understood and validated experimentally. This workshop intends to bring together researchers with both theoretical and computational expertise with polyhedral computation.
Invited Speakers
Charles Audet (École Polytechnique)
Roberto Bagnara (Università di Parma)
Endre Boros (Rutgers University)
René Brandenberg (Technische Universität München)
Jesús De Loera (University of California, Davis)
Mathieu Dutour Sikiric (École Normale Supérieure)
Khaled Elbassioni (Max-Planck-Institut für Informatik)
Matthias Franz (Siemens AG)
Komei Fukuda (ETHZ)
Vladimir Gurvich (Rutgers Center for Operations Research)
Alexander Hulpke (Colorado State University)
Hiroshi Imai (University of Tokyo)
Masakazu Kojima (Tokyo Institute of Technology)
Jean-François Maurras (Université de la Méditerranée)
Brendan D. McKay (Australian National University)
Pablo A. Parrilo (Massachusetts Institute of Technology)
Günter Rote (Freie Universität Berlin)
Gerhard Reinelt (University of Heidelberg)
Achill Schürmann (University of Magdeburg)
Tamon Stephen (Simon Fraser University)
Thorsten Theobald (Technische Universität Berlin)
Frank Vallentin (Centrum voor Wiskunde en Informatica)
|