Progress in Combinatorial Optimization
eBook - PDF

Progress in Combinatorial Optimization

  1. 386 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Progress in Combinatorial Optimization

About this book

Progress in Combinatorial Optimization provides information pertinent to the fundamental aspects of combinatorial optimization. This book discusses how to determine whether or not a particular structure exists. Organized into 21 chapters, this book begins with an overview of a polar characterization of facets of polyhedra obtained by lifting facets of lower dimensional polyhedra. This text then discusses how to obtain bounds on the value of the objective in a graph partitioning problem in terms of spectral information about the graph. Other chapters consider the notion of a triangulation of an oriented matroid and show that oriented matroid triangulation yield triangulations of the underlying polytopes. This book discusses as well the selected results and problems on perfect ad imperfect graphs. The final chapter deals with the weighted parity problem for gammoids, which can be reduced to the weighted graphic matching problem. This book is a valuable resource for mathematicians and research workers.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Progress in Combinatorial Optimization by William R. Pulleyblank in PDF and/or ePUB format, as well as other popular books in Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
Print ISBN
9780125667807
eBook ISBN
9781483264530
Topic
Mathematics
Subtopic
Discrete Mathematics
Index
Mathematics

Table of contents

  1. Front Cover
  2. Progress in Combinatorial Optimization
  3. Copyright Page
  4. Table of Contents
  5. CONTRIBUTORS
  6. PREFACE
  7. ACKNOWLEDGMENTS
  8. Chapter 1. Lifting the Facets of Polyhedra
  9. Chapter 2. Partitioning, Spectra and Linear Programming
  10. Chapter 3. Oriented Matroids and Triangulations of Convex Polytopes
  11. Chapter 4. Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming
  12. Chapter 5. Polynomial Algorithm to Recognize a Meyniel Graph
  13. Chapter 6. Integer Programming Problems for Which a Simple Rounding Type Algorithm Works
  14. Chapter 7. Notes on Perfect Graphs
  15. Chapter 8. Total Dual Integrality of Linear Inequality Systems
  16. Chapter 9. Numbers of Lengths for Representations of Interval Orders
  17. Chapter 10. Submodular Flows
  18. Chapter 11. Geometric Methods in Combinatorial Optimization
  19. Chapter 12. A Fast Algorithm that makes Matrices Optimally Sparse
  20. Chapter 13. Structural Theory for the Combinatorial Systems Characterized by Submodular Functions
  21. Chapter 14. Greedoids - A Structural Framework for the Greedy Algorithm
  22. Chapter 15. Preemptive Scheduling of Uniform Machines Subject to Release Dates
  23. Chapter 16. An Application of Matroid Polyhedral Theory to Unit-Execution Time, Tree-Precedence Job Scheduling
  24. Chapter 17. Some Problems on Dynamic/Periodic Graphs
  25. Chapter 18. Polytopes and Complexity
  26. Chapter 19. Statics and Electric Network Theory: a Unifying Role of Matroids
  27. Chapter 20. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
  28. Chapter 21. Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching