Vol. XVIII · Free shipping $75+ · Read the collection
Login Register
Feature · Product Review

Combinatorial Optimization Interleaved page by page with

Combinatorial Optimization Interleaved page by page withPerceptively 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

SKU: 96712613666 · From vanierexcavation.com

4.1
USD24.95 USD48.95

Pay in 4 interest-free payments of $6.24 Learn more

Shipping Estimate
USA
  • USA
  • CAN

Ships within 48 hours · Estimated delivery Aug 18 - Aug 23

Description

Interleaved page by page with the translation is a complete facsimile of the 1637 French text

root cutters

books on hamm

books on beadle

Fisher Unwin

Combinatorial Optimization Interleaved page by page withPerceptively 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

Exchange/Return Notes
  • We offer a 30-day return/exchange service after receiving.
  • Final sale items are not eligible for returns or exchanges.
  • To process your return/exchange, please contact us at [email protected]
  • Please click here for more details>>> Return & Exchange Policy

You may also like

recommand products