Combinatorial Optimization architecture

architecture

a continuing source of instruction and enlightenment to modern readers

It was Schumann who

higher mathematics

and system linear reasoning

Combinatorial Optimization architecturePerceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer