Book
Combinatorial optimizationEugene L. Lawler

Combinatorial optimization

Eugene L. Lawler
1975379 pages
No counted ratings yet
2 editions

Track this book

You choose which shelves are public. Progress and read dates stay yours.
Sign in
Add to list

About

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.

More by Eugene L. Lawler

All books

More like this

Reviews

Rating integrity

Healthy
Counted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.

Editions

2 editions
  • Other · English · 2001
    Dover Publications · 374 pages · 9780486414539
  • Other · English · 1975
    Oxford University Press, USA · 384 pages · 9780030848667
AlgorithmsCombinatorial optimizationComputational complexityMatroidsNetwork analysis (Planning)Mathematical optimization