Algebraic and Combinatorial Methods in Operations Research ( Volume 19 )

Publication series ：Volume 19

Author： Burkard   R. E.;Cuninghame-Green   R. A.;Zimmermann   U.  

Publisher： Elsevier Science‎

Publication year： 1984

E-ISBN: 9780080872063

P-ISBN(Paperback): 9780444875716

P-ISBN(Hardback):  9780444875716

Subject： O158 Discrete Mathematics

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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 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.

Chapter

Front Cover

pp.：  1 – 4

Algebraic and Combinatorial Methods in Operations Research

pp.：  4 – 5

Copyright Page

pp.：  5 – 8

Foreword

pp.：  6 – 12

Contents

pp.：  8 – 6

Chapter 1. Packing problems in semigroup programming

pp.：  12 – 34

Chapter 2. A greedy algorithm for solving network flow problems in trees

pp.：  34 – 46

Chapter 3. A dual optimality criterion for algebraic linear programs

pp.：  46 – 52

Chapter 4. On properties of solution sets of extremal linear programs

pp.：  52 – 66

Chapter 5. Using fields for semiring computations

pp.：  66 – 86

Chapter 6. Scheduling by non-commutative algebra

pp.：  86 – 94

Chapter 7. Pseudo-boolean functions and stability of graphs

pp.：  94 – 110

Chapter 8. Independence systems and perfect k-matroid-intersections

pp.：  110 – 126

Chapter 9. Matroids on ordered sets and the greedy algorithm

pp.：  126 – 140

Chapter 10. An algorithm for the unbounded matroid intersection polyhedron

pp.：  140 – 146

Chapter 11. Algebraic Flows

pp.：  146 – 158

Chapter 12. Linear algebra in dioids: a survey of recent results

pp.：  158 – 176

Chapter 13. Algebraic flows and time-cost tradeoff problems

pp.：  176 – 194

Chapter 14. Ranking the cuts and cut-sets of a network

pp.：  194 – 212

Chapter 15. Shortest paths in signed graphs

pp.：  212 – 226

Chapter 16. A boolean algebraic analysis of fire protection

pp.：  226 – 240

Chapter 17. Iteration and summability in semirings

pp.：  240 – 268

Chapter 18. Substitution decomposition for discrete structures and connections with combinatorial optimization

pp.：  268 – 368

Chapter 19. On max-separable optimization problems

pp.：  368 – 374

Chapter 20. Minimization of combined objective functions on integral submolar flows

pp.：  374 – 394

The users who browse this book also browse


No browse record.