Studies in Integer Programming

Name: Studies in Integer Programming | Proceedings of the Institute of Operations Research Workshop, Sponsored by IBM, University of Bonn, Germany, Sept. 8-12, 1975
Brand: Elsevier
Price: 111.0 EUR
Availability: OnlineOnly

Proceedings of the Institute of Operations Research Workshop, Sponsored by IBM, University of Bonn, Germany, Sept. 8-12, 1975

Elsevier (Verlag)

Erschienen am 10. Oktober 2011

561 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-0-08-086764-9 (ISBN)

111,00 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Personen

Inhalt

Front Cover
Studies in Integer Programming
Copyright Page
Contents
Preface
Chapter 1. Reduction and Decomposition of Integer Programs Over Cones
Chapter 2. Some Valid Inequalities for the Set Partitioning Problem
Chapter 3. Backtracking Algorithms for Network Reliability Analysis
Chapter 4. Coloring the Edges of a Hypergraph and Linear Programming Techniques
Chapter 5. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem
Chapter 6. Partial Orderings in Implicit Enumeration
Chapter 7. A Subadditive Approach to Solve Linear Integer Programs
Chapter 8. Aggregation of Inequalities in Integer Programming
Chapter 9. On the Uncapacitated Location Problem
Chapter 10. Some Coloring Techniques
Chapter 11. A Min-Max Relation for Submodular Functions on Graphs
Chapter 12. How Can Specialized Discrete and Convex Optimization Methods be Married
Chapter 13. On Integer and Mixed Integer Fractional Programming Problems
Chapter 14. Graphs with Cycles Containing Given Paths
Chapter 15. Algorithms for Exploiting the Structure of the Simple Plant Location Problem
Chapter 16. Reduction Methods for State Enumeration Integer Programming
Chapter 17. Subdegrees and Chromatic Numbers of Hypergraphs
Chapter 18. Cutting-Plane Theory: Disjunctive Methods
Chapter 19. A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness
Chapter 20. Complexity of Machine Scheduling Problems
Chapter 21. Certain Duality Principles in Integer Programming
Chapter 22. Parametric Integer Programming: the Righthand-Side Case
Chapter 23. An Example of Dual Polytopes in the Unit Hypercube
Chapter 24. Implicit Enumeration with Generalized Upper Bounds
Chapter 25. On Some Nonlinear Knapsack Problems
Chapter 26. The Minimal Integral Separator of a Threshold Graph
Chapter 27. On the Complexity of Set Packing Polyhedra
Chapter 28. Properties of Facets of Binary Polytopes
Chapter 29. Vertex Generation Methods for Problems with Logical Constraints
Chapter 30. Sensitivity Analysis in Integer Programming
Chapter 31. A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
Chapter 32. Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems
Chapter 33. On Antiblocking sets and Polyhedra
Chapter 34. On the Generality of Multi-Terminal Flow Theory
Chapter 35. Valid Inequalities, Covering Problems and Discrete Dynamic Programs
Chapter 36. Some Partial Orders Related to Boolean Optimization and the Greedy Algorithm
Chapter 37. Integer Linear Programming with Multiple Objectives

Systemvoraussetzungen

Als PDF speichern Als Link merken