Published by Springer, Berlin, 1985
ISBN 10: 354013624X ISBN 13: 9783540136248
Hardcover. Condition: ex library-good. Revised Edition. Algorithms and Combinatorics 2. xii, 362 p. 25 cm. 23 b&w figures. Yellow cloth. Ex library with labels on spine and rear endpaper, ink stamp on top edge. Bottom corners bumped.
Published by Berlin, Heidelberg : Springer-Verlag, 1994
ISBN 10: 038713624X ISBN 13: 9780387136240
Seller: MW Books, New York, NY, U.S.A.
First Edition
First Edition. Library copy - library marks remain. Very good copy in the original title-blocked cloth. Slight suggestion only of dust-dulling to the spine bands and panel edges. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description: XII, 362p. 23 illus. Notes: Bibliographic Level Mode of Issuance: MonographIncludes bibliographical references and index. Contents: 0. Mathematical Preliminaries -- 0.1 Linear Algebra and Linear Programming -- 0.2 Graph Theory -- 1. Complexity, Oracles, and Numerical Computation -- 1.1 Complexity Theory: P and NP -- 1.2 Oracles -- 1.3 Approximation and Computation of Numbers -- 1.4 Pivoting and Related Procedures -- 2. Algorithmic Aspects of Convex Sets: Formulation of the Problems -- 2.1 Basic Algorithmic Problems for Convex Sets -- 2.2 Nondeterministic Decision Problems for Convex Sets -- 3. The Ellipsoid Method -- 3.1 Geometric Background and an Informal Description -- 3.2 The Central-Cut Ellipsoid Method -- 3.3 The Shallow-Cut Ellipsoid Method -- 4. Algorithms for Convex Bodies -- 4.1 Summary of Results -- 4.2 Optimization from Separation -- 4.3 Optimization from Membership -- 4.4 Equivalence of the Basic Problems -- 4.5 Some Negative Results -- 4.6 Further Algorithmic Problems for Convex Bodies -- 4.7 Operations on Convex Bodies -- 5. Diophantine Approximation and Basis Reduction -- 5.1 Continued Fractions -- 5.2 Simultaneous Diophantine Approximation: Formulation of the Problems -- 5.3 Basis Reduction in Lattices -- 5.4 More on Lattice Algorithms -- 6. Rational Polyhedra -- 6.1 Optimization over Polyhedra: A Preview -- 6.2 Complexity of Rational Polyhedra -- 6.3 Weak and Strong Problems -- 6.4 Equivalence of Strong Optimization and Separation -- 6.5 Further Problems for Polyhedra -- 6.6 Strongly Polynomial Algorithms -- 6.7 Integer Programming in Bounded Dimension -- 7. Combinatorial Optimization: Some Basic Examples. -- 7.1 Flows and Cuts -- 7.2 Arborescences -- 7.3 Matching -- 7.4 Edge Coloring -- 7.5 Matroids -- 7.6 Subset Sums -- 7.7 Concluding Remarks -- 8. Combinatorial Optimization: A Tour d'Horizon -- 8.1 Blocking Hypergraphs and Polyhedra -- 8.2 Problems on Bipartite Graphs -- 8.3 Flows, Paths, Chains, and Cuts -- 8.4 Trees, Branchings, and Rooted and Directed Cuts -- 8.5 Matchings, Odd Cuts, and Generalizations -- 8.6 Multicommodity Flows -- 9. Stable Sets in Graphs -- 9.1 Odd Circuit Constraints and t-Perfect Graphs -- 9.2 Clique Constraints and Perfect Graphs -- 9.3 Orthonormal Representations -- 9.4 Coloring Perfect Graphs -- 9.5 More Algorithmic Results on Stable Sets -- 10. Submodular Functions -- 10.1 Submodular Functions and Polymatroids -- 10.2 Algorithms for Polymatroids and Submodular Functions -- 10.3 Submodular Functions on Lattice, Intersecting, and Crossing Families -- 10.4 Odd Submodular Function Minimization and Extensions -- References -- Notation Index -- Author Index. Subjects: Combinatorial geometry.Geometry of numbers.Mathematical optimization.Combinatorial geometry.Geometry of numbers.Mathematical optimization.Programming (Mathematics)Combinatorial geometry.Geometry of numbers.Mathematical optimization.Programming (Mathematics)Mathematics. Combinatorial analysis.Combinatorial analysis.Mathematics.Combinatorics. 1 Kg.
Published by Berlin, Heidelberg : Springer-Verlag, 1994
ISBN 10: 038713624X ISBN 13: 9780387136240
Seller: MW Books Ltd., Galway, Ireland
First Edition
First Edition. Library copy - library marks remain. Very good copy in the original title-blocked cloth. Slight suggestion only of dust-dulling to the spine bands and panel edges. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description: XII, 362p. 23 illus. Notes: Bibliographic Level Mode of Issuance: MonographIncludes bibliographical references and index. Contents: 0. Mathematical Preliminaries -- 0.1 Linear Algebra and Linear Programming -- 0.2 Graph Theory -- 1. Complexity, Oracles, and Numerical Computation -- 1.1 Complexity Theory: P and NP -- 1.2 Oracles -- 1.3 Approximation and Computation of Numbers -- 1.4 Pivoting and Related Procedures -- 2. Algorithmic Aspects of Convex Sets: Formulation of the Problems -- 2.1 Basic Algorithmic Problems for Convex Sets -- 2.2 Nondeterministic Decision Problems for Convex Sets -- 3. The Ellipsoid Method -- 3.1 Geometric Background and an Informal Description -- 3.2 The Central-Cut Ellipsoid Method -- 3.3 The Shallow-Cut Ellipsoid Method -- 4. Algorithms for Convex Bodies -- 4.1 Summary of Results -- 4.2 Optimization from Separation -- 4.3 Optimization from Membership -- 4.4 Equivalence of the Basic Problems -- 4.5 Some Negative Results -- 4.6 Further Algorithmic Problems for Convex Bodies -- 4.7 Operations on Convex Bodies -- 5. Diophantine Approximation and Basis Reduction -- 5.1 Continued Fractions -- 5.2 Simultaneous Diophantine Approximation: Formulation of the Problems -- 5.3 Basis Reduction in Lattices -- 5.4 More on Lattice Algorithms -- 6. Rational Polyhedra -- 6.1 Optimization over Polyhedra: A Preview -- 6.2 Complexity of Rational Polyhedra -- 6.3 Weak and Strong Problems -- 6.4 Equivalence of Strong Optimization and Separation -- 6.5 Further Problems for Polyhedra -- 6.6 Strongly Polynomial Algorithms -- 6.7 Integer Programming in Bounded Dimension -- 7. Combinatorial Optimization: Some Basic Examples. -- 7.1 Flows and Cuts -- 7.2 Arborescences -- 7.3 Matching -- 7.4 Edge Coloring -- 7.5 Matroids -- 7.6 Subset Sums -- 7.7 Concluding Remarks -- 8. Combinatorial Optimization: A Tour d'Horizon -- 8.1 Blocking Hypergraphs and Polyhedra -- 8.2 Problems on Bipartite Graphs -- 8.3 Flows, Paths, Chains, and Cuts -- 8.4 Trees, Branchings, and Rooted and Directed Cuts -- 8.5 Matchings, Odd Cuts, and Generalizations -- 8.6 Multicommodity Flows -- 9. Stable Sets in Graphs -- 9.1 Odd Circuit Constraints and t-Perfect Graphs -- 9.2 Clique Constraints and Perfect Graphs -- 9.3 Orthonormal Representations -- 9.4 Coloring Perfect Graphs -- 9.5 More Algorithmic Results on Stable Sets -- 10. Submodular Functions -- 10.1 Submodular Functions and Polymatroids -- 10.2 Algorithms for Polymatroids and Submodular Functions -- 10.3 Submodular Functions on Lattice, Intersecting, and Crossing Families -- 10.4 Odd Submodular Function Minimization and Extensions -- References -- Notation Index -- Author Index. Subjects: Combinatorial geometry.Geometry of numbers.Mathematical optimization.Combinatorial geometry.Geometry of numbers.Mathematical optimization.Programming (Mathematics)Combinatorial geometry.Geometry of numbers.Mathematical optimization.Programming (Mathematics)Mathematics. Combinatorial analysis.Combinatorial analysis.Mathematics.Combinatorics. 1 Kg.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Springer, 1988
ISBN 10: 354013624X ISBN 13: 9783540136248
Seller: Buchpark, Trebbin, Germany
Condition: Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. 1. Auflage. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 374 | Produktart: Sonstiges.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it see.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: Books Unplugged, Amherst, NY, U.S.A.
Condition: New. Buy with confidence! Book is in new, never-used condition 1.66.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. Like New. book.
Published by Springer Bln, 1993
ISBN 10: 3540567402 ISBN 13: 9783540567400
Seller: Buchpark, Trebbin, Germany
Condition: Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. 2. Auflage. Außen: angestoßen. Innen: Seiten vergilbt. Es kann sich um eine ältere Auflage handeln., Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalt | Seiten: 374 | Sprache: Englisch | Produktart: Bücher.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: GoldenWavesOfBooks, Fayetteville, TX, U.S.A.
Paperback. Condition: new. New. Fast Shipping and good customer service.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: Wizard Books, Long Beach, CA, U.S.A.
Paperback. Condition: new. New.
Published by Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Seller: Front Cover Books, Denver, CO, U.S.A.
Condition: new.