Algebraic and Combinatorial Methods in Operations Research - 1st Edition - ISBN: 9780444875716, 9780080872063

Algebraic and Combinatorial Methods in Operations Research, Volume 19

1st Edition

Editors: R.E. Burkard R.A. Cuninghame-Green U. Zimmermann
eBook ISBN: 9780080872063
Imprint: North Holland
Published Date: 1st January 1984
Page Count: 380
Tax/VAT will be calculated at check-out Price includes VAT (GST)
43.99
72.95
54.95
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

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


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.


Details

No. of pages:
380
Language:
English
Copyright:
© North Holland 1984
Published:
Imprint:
North Holland
eBook ISBN:
9780080872063

Reviews

@qu:For researchers in discrete optimisation, this book is very important. @source:Opsearch


About the Editors

R.E. Burkard Editor

R.A. Cuninghame-Green Editor

U. Zimmermann Editor

Affiliations and Expertise

Mathematisches Institut Universitat zu Koln