Graph Theory and Combinatorial Optimization

Author:   David Avis ,  Alain Hertz ,  Odile Marcotte
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 2005
ISBN:  

9781441938114


Pages:   266
Publication Date:   29 October 2010
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $274.56 Quantity:  
Add to Cart

Share |

Graph Theory and Combinatorial Optimization


Add your own review!

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:   Softcover reprint of hardcover 1st ed. 2005
Dimensions:   Width: 15.50cm , Height: 1.50cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9781441938114


ISBN 10:   1441938117
Pages:   266
Publication Date:   29 October 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List