Limone Time
Combinatorial optimization

Combinatorial optimization

Book (1975)

Perceptively 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.

Genres
Algorithms, Combinatorial optimization, Computational complexity, Matroids, Network analysis (Planning), Mathematical optimization
Author
Eugene L. Lawler
Pages
379

Where to find it

Amazon ↗

Some links are affiliate links: if you buy, the site may receive a commission at no extra cost to you.

Can't decide?

Tell me what you like and I will suggest what to read for you.

Try it for free

Similar titles

Graphs, algorithms, and optimization (2004)Computer Algebra in Scientific Computing (2009)The art of computer programming (1922)Computer Networks (1981)Advances in Swarm Intelligence (2012)JavaScript: The Definitive Guide (1996)QualityLand (2017)Introduction to Algorithms (1990)