Graph Theory and Combinatorial Optimization~tqw~ darksiderg torrent

*******************************************************************************
Graph Theory and Combinatorial Optimization
*******************************************************************************

General Information

Type.................: Ebook
Part Size............: 15,314,138 bytes

Post Information

Posted by............: ~tqw~

Release Notes

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

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 contributedchapters in their areas of expertise.

Table of Contents

1 Variable neighborhood search for extremal graphs. XI. Bounds on
algebraic connectivity 1
2 Problems and results on geometric patterns 17
3 Data depth and maximum feasible subsystems 37
4 The maximum independent set problem and augmenting graphs 69
5 Interior point and semidefinite approaches in combinatorial optimization
101
6 Balancing mixed-model supply chains 159
7 Bilevel programming : a combinatorial perspective 191
8 Visualizing, finding and packing dijoins 219
9 Hypergraph coloring by bichromatic exchanges 255

Product Details

* ISBN: 0387255915
* ISBN-13: 9780387255910
* Format: Hardcover, 264pp
* Publisher: Springer-Verlag New York, LLC
* Pub. Date: May 2005

Install Notes

Adobe Acrobat Reader

Recent Searches