𝔖 Scriptorium
✦   LIBER   ✦
📁

Combinatorial Optimization: Packing and Covering

✍ Scribed by Gérard Cornuéjols

Publisher
Society for Industrial Mathematics
Year
1987
Tongue
English
Leaves
145
Series
CBMS-NSF Regional Conference Series in Applied Mathematics
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

Математика;Методы оптимизации;

📜 SIMILAR VOLUMES

Combinatorial Optimization: Packing and
📁 Combinatorial Optimization: Packing and Covering
✍ Gérard Cornuéjols 📂 Library 📅 1987 🏛 Society for Industrial Mathematics 🌐 English

This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural line

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 📂 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

Combinatorial Optimization: Packing and
📁 Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics)
✍ Gérard Cornuéjols 📂 Library 📅 1987 🏛 Society for Industrial Mathematics 🌐 English

This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural line

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