The Barnes & Noble Holiday Gift Guide! Shop NowThe Barnes & Noble Holiday Gift Guide! Shop Now
Product Image
Add Item to wish listAdd Item to wish list

Combinatorial Optimization: Networks and Matroids

By Eugene Lawler
eBook
$24.95
By Eugene Lawler
|Write a Review
Rewards iconEarn 5X Rewards 1/1 - 12/31
Formats
See All Formats & Editions
In stock
Buy this eBook as a gift for someone else

Personalize your gift

Required *

  • If the selected date is today, the recipient will receive the eBook within 1 hour.
  • If the selected date is in the future, the eBook will be delivered to the recipient around 3:00 AM EST on the specified date.
0 / 250
Pick up in store
Your local store may have stock of this item.

Available on compatible , the free NOOK App, and in My Digital Library

NOOK App

Open NOOK app

Download NOOK app

[@portabletext/react] Unknown block type "image", specify a component for it in the `components.types` prop

NOOK Devices

  • NOOK GlowLight 4 Plus
  • NOOK GlowLight 4e
  • NOOK GlowLight 4
  • NOOK GlowLight Plus 7.8
  • NOOK GlowLight 3
  • NOOK GlowLight Plus 6
  • NOOK 9" Lenovo Tablet (Arctic Grey and Frost Blue)
  • NOOK 10" HD Lenovo Tablet
  • NOOK Tablet 7" & 10.1
  • NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
  • NOOK by Samsung [Tab 4 10.1, S2 & E]
  • NOOK for iOS
  • NOOK for Android

BN.com website

Go to your Digital Library in My Account

Limit 1 per customer
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 and concrete computational complexity in departments of computer science and mathematics.

Categories