Studies on Graphs and Discrete Programming
eBook - PDF

Studies on Graphs and Discrete Programming

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

Studies on Graphs and Discrete Programming

About this book

Studies on Graphs and Discrete Programming

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.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. 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 Studies on Graphs and Discrete Programming by P. Hansen in PDF and/or ePUB format, as well as other popular books in Matematica & Matematica discreta. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
1981
Print ISBN
9780444862167
eBook ISBN
9780080871707
Topic
Matematica
Subtopic
Matematica discreta

Table of contents

  1. Front Cover
  2. Studies on Graphs and Discrete Programming
  3. Copyright Page
  4. Contents
  5. Foreword
  6. Chapter 1. Integer and fractional matchings
  7. Chapter 2. Packing problems
  8. Chapter 3. Admissible transformations and their application to matching problems
  9. Chapter 4. Polynomial algorithms for totally dual integral systems and extensions
  10. Chapter 5. Minimal costreliability ratio spanning tree
  11. Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem
  12. Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion
  13. Chapter 8. On the number of nonnegative integer solutions of a system of linear diophantine equations
  14. Chapter 9. The administration of standard length telephone cable reels
  15. Chapter 10. Threshold numbers and threshold completions
  16. Chapter 11. Constrained location and the Weber–Rawls problem
  17. Chapter 12. A bounding technique for integer linear programming with binary variables
  18. Chapter 13. School timetables
  19. Chapter 14. How to color claw-free perfect graphs
  20. Chapter 15. Properties of some extremal problems of permutation cycles
  21. Chapter 16. Minimal test set for diagnosing a tree system
  22. Chapter 17. Sufficient conditions for graphs to have threshold number 2
  23. Chapter 18. Optimum synthesis of a network with non-simultaneous multicommodity flow requirements
  24. Chapter 19. Maximizing submodular set functions: formulations and analysis of algorithms
  25. Chapter 20. A solvable machine maintenance model with applications
  26. Chapter 21. Convergence of decomposition algorithms for the traffic assignment problem
  27. Chapter 22. A recursive method for solving assignment problems
  28. Chapter 23. Asymptotical estimations for the number of cliques of uniform hypergraphs
  29. Chapter 24. A suggested extension of special ordered sets to non-separable non-convex programming problems
  30. Chapter 25. Parametric multicriteria integer programming
  31. Chapter 26. Scheduling in sports