Rainer Schrader

Bernhard Korte

Laszlo Lovasz

With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the Rado-Hall theorem on transversals is generalized. The self-contained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids.

Greedoids

Michael Jünger

Achim Bachem

Ulrich Derigs

This proceedings volume contains extended abstracts of talks presented at the 18th Symposium on Operations Research held at the University of Cologne, September 1-3, 1993. The Symposia on Operations Research are the annual meetings of the Gesellschaft fiir Mathematik, Okonometrie und Operations Research (GMOOR), a scientific society providing a link between research and applications in the areas of applied mathematics, economics and operations research. The broad range of interests and scientific activities covered by GMOOR and its members was demonstrated by about 250 talks presented at the 18th Symposium. As in l'ecent years, emphasis was placed on optimization and stochastics, this year with a special focus on combinatorial optimization and discrete mathematics. We appreciate that with sections on parallel and distributed computing and on scientific computing also new fields could be integrated into the scope of the GMOOR. This book contains extended abstracts of most of the papers presented at the con ference. Long versions and full papers of the talks are expected to appear elsewhere in refereed periodicals. The contributions were divided into sixteen sections: (1) Theory of Optimization, (2) Computational Methods of Optimization, (3) Combinatorial Optimization and Dis crete Mathematics, (4) Scientific Computing, (5) Decision Theory, (6) Mathematical Economics and Game Theory, (7) Banking, Finance and Insurance, (8) Econometrics, (9) Macroeconomics and Economic Theory, (10) Stochastics, (11) Production and Lo gistics, (12) System and Control Theory, (13) Routing and Scheduling, (14) Knowledge Based Systems, (15) Information Systems and (16) Parallel and Distributed Compu ting.

Rainer Schrader

Books

Your next favorite book is out there