Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada graph theory and combinatorial optimization
Type
Physical Book
Illustrated by
Publisher
Author
Year
2010
Language
English
Pages
266
Format
Paperback
Dimensions
23.4 x 15.6 x 1.5 cm
Weight
0.40 kg.
ISBN
1441938117
ISBN13
9781441938114
Categories

graph theory and combinatorial optimization

David Avis (Illustrated by) · Alain Hertz (Illustrated by) · Odile Marcotte (Illustrated by) · Springer · Paperback

graph theory and combinatorial optimization - Avis, David ; Hertz, Alain ; Marcotte, Odile

Cheaper New Book Imported to Netherlands
Delivery: 04 Sep - 11 Sep Shipping: 13 to 17 business days.
€ 105,96
Faster New Book Imported to Netherlands
Delivery: 24 Aug - 26 Aug Shipping: 5 to 6 business days.
€ 143,92
Import costs and 9% BTW included in the price ✅
€ 105,96

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "graph theory and combinatorial optimization"

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. Belhaiza et al (Chapter 1) study several conjectures on the algebraic connecticity of graphs. Brass and Pach (Chapter 2) survey the results in the theory of geometric patterns. Fukuda and Rosta (Chapter 3) discuss various data depth measures that were first introduced in nonparametric statistics. Hertz and Lozin (Chapter 4) examine the method of augmenting graphs for solving the maximum independent set problem. Krishnan and Terlaky (Chapter 5) present a survey of semidefinite and interior point methods for solving NP-hard combinatorial optimization problems to optimality and designing approximation algorithms for some of these problems. Kubiak (Chapter 6) presents a study of balancing mixed-model supply chains. Marcotte and Savard (chapter 7) outline and overview two classes of bilevel programs. Shepherd and Vetta (Chapter 8) present a study of disjoins, and de Werra (Chapter 9) generalizes a coloring property of unimodular hypergraphs. 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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews