Alexander Schrijver

Alexander Schrijver is a Dutch mathematician and computer scientist known for his extensive work in combinatorial optimization, graph theory, and discrete mathematics. His research and publications have significantly influenced the fields of operations research and theoretical computer science. Schrijver serves as a professor at the University of Amsterdam and researcher at the Centrum Wiskunde & Informatica (CWI). His textbook "Theory of Linear and Integer Programming" (1986) is considered a foundational text in the field, while his three-volume work "Combinatorial Optimization: Polyhedra and Efficiency" (2003) provides one of the most comprehensive treatments of the subject. His contributions to matching theory, polyhedral combinatorics, and network flows have earned him numerous accolades, including the Fulkerson Prize and the Spinoza Prize. The Schrijver graph, a specific type of graph construction in combinatorial mathematics, is named after him. The mathematical techniques and algorithms developed by Schrijver have practical applications in transportation, scheduling, and network design. His work on cutting plane methods and polynomial-time algorithms has advanced both the theoretical understanding and practical implementation of optimization problems.

Readers value Schrijver's books as technical references but note they require advanced mathematical background. His "Theory of Linear and Integer Programming" receives attention for its thorough coverage and rigorous proofs. What readers liked: - Clear logical progression through topics - Comprehensive citation of historical developments - Detailed mathematical derivations - Quality of problem sets What readers disliked: - Dense notation makes books hard to read cover-to-cover - Limited worked examples - Few intuitive explanations for beginners - High price point of specialized volumes From Goodreads/Amazon: "Theory of Linear and Integer Programming" averages 4.4/5 stars (42 ratings) "Combinatorial Optimization" averages 4.7/5 stars (15 ratings) Notable reader comment: "Excellent reference but not suitable as first introduction to topic. Requires solid foundation in linear algebra and mathematical maturity." (Mathematics Stack Exchange review)

Combinatorial Optimization: Theory and Algorithms - A comprehensive textbook covering the foundations of combinatorial optimization, including linear programming, network flows, matroids, and NP-completeness.

Theory of Linear and Integer Programming - An in-depth examination of linear programming theory, integer programming, and algorithms for solving such problems.

Geometric Algorithms and Combinatorial Optimization - A detailed exploration of geometric methods in optimization, including ellipsoid and interior point methods.

Paths, Flows, and VLSI-Layout - A collection of papers addressing optimization problems in VLSI design, with focus on routing and layout algorithms.

A Course in Combinatorial Optimization - A lecture notes compilation covering fundamental topics in combinatorial optimization and their applications.

Polyhedral Combinatorics - A detailed study of polyhedral theory and its applications in combinatorial optimization problems.

Submodular Functions and Optimization - An examination of submodular functions and their role in discrete optimization problems.

Routing and Network Design on Geometric Graphs - Analysis of algorithms and complexity in geometric graph theory and network design.

Martin Grötschel focuses on optimization, combinatorial mathematics and operations research. He has written foundational texts on linear and integer programming that complement Schrijver's work.

Jack Edmonds developed key theories in combinatorial optimization and matching problems. His work on the matching algorithm and matroid theory influenced the field that Schrijver later documented extensively.

László Lovász made contributions to combinatorial optimization and graph theory. He collaborated with Schrijver on several papers and shares similar research interests in discrete mathematics.

George Nemhauser specializes in integer programming and combinatorial optimization. His books on integer and combinatorial optimization cover similar ground to Schrijver's work but with different perspectives on applications.

William Cook studies computational complexity and optimization in combinatorics. His work on the traveling salesman problem and computational methods connects to the algorithmic aspects that Schrijver explores.