Graph Theory and Combinatorial Optimization
Author:   David Avis ,  Alain Hertz ,  Odile Marcotte
Publisher:   Springer-Verlag New York Inc.
Edition:   2005 ed.
ISBN:  

9780387255910


Pages:   266
Publication Date:   28 April 2005
Format:   Hardback
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Our Price $274.56 Quantity:  
Add to Cart

Share |

Graph Theory and Combinatorial Optimization


Overview

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.

Full Product Details

Author:   David Avis ,  Alain Hertz ,  Odile Marcotte
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2005 ed.
Dimensions:   Width: 15.50cm , Height: 1.70cm , Length: 23.50cm
Weight:   1.270kg
ISBN:  

9780387255910


ISBN 10:   0387255915
Pages:   266
Publication Date:   28 April 2005
Audience:   College/higher education ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Table of Contents

Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity.- Problems and Results on Geometric Patterns.- Data Depth and Maximum Feasible Subsystems.- The Maximum Independent Set Problem and Augmenting Graphs.- Interior Point and Semidefinite Approaches in Combinatorial Optimization.- Balancing Mixed-Model Supply Chains.- Bilevel Programming: A Combinatorial Perspective.- Visualizing, Finding and Packing Dijoins.- Hypergraph Coloring by Bichromatic Exchanges.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now