Connections in Combinatorial Optimization

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

191,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-3 Wochen

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

Filling the gap between introductory and encyclopedic treatments, this book provides rich and appealing material for a second course in combinatorial optimization. This book is suitable for graduate students as well as a reference for established researchers.

Über den Autor

András Frank is the founder and head of the MTA-ELTE Egerváry Research Group (EGRES) at Eötvös University. He was head of the Department of Operations Research at Eötvös University between 1995 and 2009. In 2002, he was awarded the Tibor Szele Prize by the János Bolyai Mathematical Society, and in 2009, the Cultural Ministry of Hungary awarded him the Szent-Gyorgyi Albert Prize.

Inhaltsverzeichnis

Preface

PART I - Basic Combinatorial Optimization

1: Elements of graphs and hypergraphs

2: Connectivity, paths, and matchings

3: Elements of network optimization

4: Elements of polyhedral combinatorics

5: Elements of matroid theory

PART II - Higher-Order Connections

6: Efficient algorithms for flows and cuts

7: Structure and representations of cuts

8: The splitting off operation and constructive characterizations

9: Orientations of graphs and hypergraphs

10: Trees and arborescences: packing and covering

11: Preserving and improving connections

PART III - Semimodular Optimization

12: Setting the stage: aspects and approaches

13: Matroid optimization

14: Generalized polymatroids

15: Relaxing semimodularity

16: Submodular flows

17: Covering supermodular functions by digraphs

Solutions to selected problems

Bibliography

Index

Details

Erscheinungsjahr:	2011
Fachbereich:	Allgemeines
Genre:	Importe , Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Inhalt:	Gebunden
ISBN-13:	9780199205271
ISBN-10:	0199205272
Sprache:	Englisch
Einband:	Gebunden
Autor:	Frank, Andras
Hersteller:	Oxford University Press
Verantwortliche Person für die EU:	Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße:	234 x 150 x 41 mm
Von/Mit:	Andras Frank
Erscheinungsdatum:	01.06.2011
Gewicht:	1,089 kg

Artikel-ID: 133189689

Über den Autor

Inhaltsverzeichnis

Preface

PART I - Basic Combinatorial Optimization

1: Elements of graphs and hypergraphs

2: Connectivity, paths, and matchings

3: Elements of network optimization

4: Elements of polyhedral combinatorics

5: Elements of matroid theory

PART II - Higher-Order Connections

6: Efficient algorithms for flows and cuts

7: Structure and representations of cuts

8: The splitting off operation and constructive characterizations

9: Orientations of graphs and hypergraphs

10: Trees and arborescences: packing and covering

11: Preserving and improving connections

PART III - Semimodular Optimization

12: Setting the stage: aspects and approaches

13: Matroid optimization

14: Generalized polymatroids

15: Relaxing semimodularity

16: Submodular flows

17: Covering supermodular functions by digraphs

Solutions to selected problems

Bibliography

Index

Details

Erscheinungsjahr:	2011
Fachbereich:	Allgemeines
Genre:	Importe , Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Inhalt:	Gebunden
ISBN-13:	9780199205271
ISBN-10:	0199205272
Sprache:	Englisch
Einband:	Gebunden
Autor:	Frank, Andras
Hersteller:	Oxford University Press
Verantwortliche Person für die EU:	Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße:	234 x 150 x 41 mm
Von/Mit:	Andras Frank
Erscheinungsdatum:	01.06.2011
Gewicht:	1,089 kg