Combinatorial Optimization and system linear reasoning

and system linear reasoning

This handsome and provocative volume is enhanced by 302 drawings by the author that complement and amplify each subject area discussed

he combined his medieval craft ideals with his skills as one of Britain's most sophisticated

ukiyo-e prints

quadratic form

Combinatorial Optimization and system linear reasoningPerceptively 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