Algebraic and Combinatorial Methods in Operations Research
- 1st Edition, Volume 19 - January 1, 1984
- Imprint: North Holland
- Editors: R.E. Burkard, R.A. Cuninghame-Green, U. Zimmermann
- Language: English
- Hardback ISBN:9 7 8 - 0 - 4 4 4 - 8 7 5 7 1 - 6
- Paperback ISBN:9 7 8 - 0 - 4 4 4 - 5 5 7 9 2 - 6
- eBook ISBN:9 7 8 - 0 - 0 8 - 0 8 7 2 0 6 - 3
For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteFor the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability.
Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.
Foreword. Packing Problems in Semigroup Programming (J. Aráoz). A Greedy Algorithm for Solving Network Flow Problems in Trees (P. Brucker). A Dual Optimality Criterion for Algebraic Linear Programs (P. Brucker, W. Papenjohann and U. Zimmermann). On Properties of Solution Sets of Extremal Linear Programs (P. Butkovič). Using Fields for Semiring Computations (R.A. Cuninghame-Green). Scheduling by Non-Commutative Algebra (R.A. Cuninghame-Green and W.F. Borawitz). Pseudo-Boolean Functions and Stability of Graphs (C. Ebenegger, P.L. Hammer and D. de Werra). Independence Systems and Perfect k-Matroid Intersections (R. Euler). Matroids on Ordered Sets and The Greedy Algorithm (U. Faigle). An Algorithm for the Unbounded Matroid Intersection Polyhedron (A. Frank and E. Tardos). Algebraic Flows (A.M. Frieze). Linear Algebra in Dioids; A Survey of Recent Results (M. Gondran and M. Minoux). Algebraic Flows and Time-Cost Tradeoff Problems (H.W. Hamacher and S. Tufekci). Ranking the Cuts and Cut-Sets of a Network (H.W. Hamacher, J.-C. Picard and M. Queyranne). Shortest Paths in Signed Graphs (P. Hansen). A Boolean Algebraic Analysis of Fire Protection (B.L. Hulme A.W. Shiver and P.J. Slater). Iteration and Summability in Semirings (B. Mahr). Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization (R.H. Möhring and F.J. Radermacher). On Max-Separable Optimization Problems (K. Zimmermann). Minimization of Combined Objective Functions on Integral Submodular Flows (U. Zimmermann).
- Edition: 1
- Volume: 19
- Published: January 1, 1984
- No. of pages (eBook): 380
- Imprint: North Holland
- Language: English
- Hardback ISBN: 9780444875716
- Paperback ISBN: 9780444557926
- eBook ISBN: 9780080872063
UZ
U. Zimmermann
Affiliations and expertise
Mathematisches Institut
Universitat zu KolnRead Algebraic and Combinatorial Methods in Operations Research on ScienceDirect