0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Optimization

Buy Now

Graph Theory and Combinatorial Optimization (Hardcover, 2005 ed.) Loot Price: R3,130
Discovery Miles 31 300
Graph Theory and Combinatorial Optimization (Hardcover, 2005 ed.): David Avis, Alain Hertz, Odile Marcotte

Graph Theory and Combinatorial Optimization (Hardcover, 2005 ed.)

David Avis, Alain Hertz, Odile Marcotte

 (sign in to rate)
Loot Price R3,130 Discovery Miles 31 300 | Repayment Terms: R293 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.

Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Release date: April 2005
First published: 2005
Editors: David Avis • Alain Hertz • Odile Marcotte
Dimensions: 235 x 155 x 21mm (L x W x T)
Format: Hardcover
Pages: 266
Edition: 2005 ed.
ISBN-13: 978-0-387-25591-0
Categories: Books > Science & Mathematics > Mathematics > Optimization > General
LSN: 0-387-25591-5
Barcode: 9780387255910

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners