[Acpc-l] INFORMATIKKOLLOQUIUM: 7.4.2003

[Werner Purgathofer]

Der Fachbereich Informatik und die Österreichische Computer Gesellschaft
laden zu folgendem Vortrag ein:
========================================================================

Professor Dr. Robert E. Bixby
Rice University, Houston, Texas

Datum: 7.4.2003, 17.00 Uhr pünktlich
Ort: Zemanek Hörsaal, Favoritenstraße 11/Erdgeschoß/roter Bereich

TITEL: Solving Linear and Integer Programs
==========================================
Abstract: Airlines don't schedule without it, and refineries don't
produce gasoline without it. Wall street is investing in it. "It" is
linear and integer programming. In this talk we will investigate the
computational state-of-the-art in these ever-more pervasive
techniques.
We will begin by describing extensive computational results based on a
large set of real-world linear programs. These results will
demonstrate that linear-programming algorithms have achieved over a
2000 fold speed improvement in the last 15 years. Combined with
machine improvements, the net result is total improvement of a factor
of nearly 2 million!
For integer programming, recent results are even more striking. Over
the last several decades, from the early 1970s to as recently as 1998,
the underlying solution technology in commercial mixed-integer
programming codes remained essentially unchanged. Algorithms
improved, but mainly because the core linear programming computations
improved, and machines got faster. This in spite of important
advances in the theory, many of these advances having clear
computational value. In the last several years, that situation has
changed dramatially. In this talk we will discuss several of the
specific ways in which it has changed. Significant computational
results will be presented.

==================================================
Kurzbiographie zu Professor Dr. Robert E. Bixby
==================================================
Robert E. Bixby ist Research Professor of Management in Rice
University's Jesse H. Jones School of Management, and Noah Harding
Professor Emeritus of Computational and Applied Mathematics in Rice
University's Department of Computational and Applied Mathematics.
Dr. Bixby studierte an der University of California-Berkeley (BS) und
an der Cornell University (PhD in Operations Research). Er hatte
akademische Positionen inne in Cornell, University of Kentucky,
University of Wisconsin-Madison, Northwestern University, am Institut
für Operations Research an der Universität Bonn, im Mathematischen
Institut an der Universität Augsburg, dem Konrad-Zuse-Zentrum für
Informationstechnik in Berlin, und an der Technischen Universität
Berlin.
Professor Dr. Bixby ist Chairman der Mathematical Programming Society
und war Editor-in-Chief der Zeitschrift Mathematical Programming. Er
hat über 50 wissenschaftliche Arbeiten publiziert. Er ist Mitglied der
National Academy of Engineering, und wurde bereits mehrfach mit
hochrangigen Preisen ausgezeichnet, unter anderem mit dem
Beale-Orchard-Hayes Prize for Computational Mathematical Programming
der Mathematical Programming Society.
Er ist Gründer der Firma CPLEX Optimization, die seit 1989 sehr
erfolgreich erfolgreich Integer und Linear Programming Software
Komponenten erstellt. CPLEX Optimization wurde 1997 von ILOG
übernommen. Seitdem ist er Mitglied im Vorstand von ILOG.

Weitere Informationen finden Sie auf
http://www.caam.rice.edu/~bixby/default.htm


Kontaktperson an TU Wien: Prof. Dr. Petra Mutzel, 58801-18614

-----------------------------------------------------------------------
"Der Fachbereich Informatik wird unterstützt von Siemens AG Österreich"




--
  Werner Purgathofer             | Tel. +43(1)58801 18648
  Technische Universitaet Wien   | http://www.cg.tuwien.ac.at