
Studies on Graphs and Discrete Programming
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions
Content
- Front Cover
- Studies on Graphs and Discrete Programming
- Copyright Page
- Contents
- Foreword
- Chapter 1. Integer and fractional matchings
- Chapter 2. Packing problems
- Chapter 3. Admissible transformations and their application to matching problems
- Chapter 4. Polynomial algorithms for totally dual integral systems and extensions
- Chapter 5. Minimal costreliability ratio spanning tree
- Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem
- Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion
- Chapter 8. On the number of nonnegative integer solutions of a system of linear diophantine equations
- Chapter 9. The administration of standard length telephone cable reels
- Chapter 10. Threshold numbers and threshold completions
- Chapter 11. Constrained location and the Weber-Rawls problem
- Chapter 12. A bounding technique for integer linear programming with binary variables
- Chapter 13. School timetables
- Chapter 14. How to color claw-free perfect graphs
- Chapter 15. Properties of some extremal problems of permutation cycles
- Chapter 16. Minimal test set for diagnosing a tree system
- Chapter 17. Sufficient conditions for graphs to have threshold number 2
- Chapter 18. Optimum synthesis of a network with non-simultaneous multicommodity flow requirements
- Chapter 19. Maximizing submodular set functions: formulations and analysis of algorithms
- Chapter 20. A solvable machine maintenance model with applications
- Chapter 21. Convergence of decomposition algorithms for the traffic assignment problem
- Chapter 22. A recursive method for solving assignment problems
- Chapter 23. Asymptotical estimations for the number of cliques of uniform hypergraphs
- Chapter 24. A suggested extension of special ordered sets to non-separable non-convex programming problems
- Chapter 25. Parametric multicriteria integer programming
- Chapter 26. Scheduling in sports
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.