http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Algebraic and combinatorial methods in operations research
proceedings of the Workshop on Algebraic Structures in Operations Research
Workshop on Algebraic Structures in Operations Research.
Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.
1 online resource (viii, 381 pages) : illustrations
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.
Front Cover; Algebraic and Combinatorial Methods in Operations Research; Copyright Page; Foreword; Contents; Chapter 1. Packing problems in semigroup programming; Chapter 2. A greedy algorithm for solving network flow problems in trees; Chapter 3. A dual optimality criterion for algebraic linear programs; Chapter 4. On properties of solution sets of extremal linear programs; Chapter 5. Using fields for semiring computations; Chapter 6. Scheduling by non-commutative algebra; Chapter 7. Pseudo-boolean functions and stability of graphs.
edited by R.E. Burkard, R.A. Cuninghame-Green, and U. Zimmermann.
Amsterdam ; New York : North Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1984
127729:122819 Elsevier Science & Technology