Produktart
Zustand
Einband
Weitere Eigenschaften
Gratisversand
Land des Verkäufers
Verkäuferbewertung
Verlag: Berlin, Heidelberg : Springer-Verlag, 1994
ISBN 10: 038713624XISBN 13: 9780387136240
Anbieter: MW Books, New York, NY, USA
Buch Erstausgabe
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.
Verlag: Berlin, Heidelberg : Springer-Verlag, 1994
ISBN 10: 038713624XISBN 13: 9780387136240
Anbieter: MW Books Ltd., Galway, Irland
Buch Erstausgabe
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.
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: GreatBookPrices, Columbia, MD, USA
Buch
Zustand: New.
Verlag: Springer Bln, 1993
ISBN 10: 3540567402ISBN 13: 9783540567400
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: 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.
Verlag: Springer, 1988
ISBN 10: 354013624XISBN 13: 9783540136248
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. 1. Auflage. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | ISBN/EAN: 354013624x[Sonstiges].
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Buch
Zustand: New.
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: moluna, Greven, Deutschland
Buch Print-on-Demand
Zustand: 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.
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: Books Unplugged, Amherst, NY, USA
Buch
Zustand: New. Buy with confidence! Book is in new, never-used condition 1.66.
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: California Books, Miami, FL, USA
Buch
Zustand: New.
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Buch
Zustand: New. Series: Algorithms and Combinatorics. Num Pages: 374 pages, biography. BIC Classification: GPFC; KCA; PBKQ; PBV. Category: (P) Professional & Vocational. Dimension: 242 x 170 x 20. Weight in Grams: 648. . 2011. 2nd ed. 1993. Softcover reprint of the original 2. Paperback. . . . .
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Buch
Paperback. Zustand: Like New. Like New. book.
Verlag: Springer, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: GreatBookPrices, Columbia, MD, USA
Buch
Zustand: As New. Unread book in perfect condition.
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2011
ISBN 10: 3642782426ISBN 13: 9783642782428
Anbieter: Kennys Bookstore, Olney, MD, USA
Buch
Zustand: New. Series: Algorithms and Combinatorics. Num Pages: 374 pages, biography. BIC Classification: GPFC; KCA; PBKQ; PBV. Category: (P) Professional & Vocational. Dimension: 242 x 170 x 20. Weight in Grams: 648. . 2011. 2nd ed. 1993. Softcover reprint of the original 2. Paperback. . . . . Books ship from the US and Ireland.