Bernhard Korte Book order

The book explores the concept of greedoids, which emerged from discussions on optimization problems involving independence systems and matroids. The authors identified that the hereditary property of these systems was often unnecessary; instead, a weaker condition called accessibility suffices. This insight led to in-depth investigations into the structures and properties of greedoids, expanding the understanding of optimization beyond traditional boundaries. The work is rooted in mathematical programming and highlights significant theoretical advancements in the field.

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.