Analysis and Design of Algorithms in Combinatorial Optimization

✍ Scribed by G. Ausiello, M. Lucertini (eds.)

Publisher: Springer-Verlag Wien
Year: 1981
Tongue: English
Leaves: 212
Series: International Centre for Mechanical Sciences 266
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Front Matter....Pages I-IX
Non-Deterministic Polynomial Optimization Problems and Their Approximation....Pages 1-35
A Characterization of Reductions among Combinatorial Problems....Pages 37-63
A Recursive Approach to the Implementation of Enumerative Methods....Pages 65-83
Data Structures for Combinatorial Problems....Pages 85-96
Data Structures for Bidimensional Memory....Pages 97-105
Complexity of Optimum Undirected Tree Problems: A Survey of Recent Results....Pages 107-128
An Introduction to Polymatroidal Network Flows....Pages 129-145
Approximation Algorithms for Bin Packing Problems: A Survey....Pages 147-172
Additional Constraints in the Group Theoretical Approach to Integer Programming....Pages 173-209

✦ Subjects

Mechanics; Programming Languages, Compilers, Interpreters

📜 SIMILAR VOLUMES

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2005 🏛 Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte 📂 Library 📅 2012 🏛 Springer 🌐 English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

Analysis and Design of Algorithms for Co

📁 Analysis and Design of Algorithms for Combinatorial Problems

✍ G. Ausiello and M. Lucertini (Eds.) 📂 Library 📅 1985 🏛 Elsevier Science Ltd 🌐 English

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for mos