Grötschel M (28 results)

Hardcover. Condition: sehr Gut. S. 263. m. viel. Abb. (illustrator).

gebundene Ausgabe. Condition: Gut. 655 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1235. …

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: New.

655 pp., 3540120823 Sprache: Englisch Gewicht in Gramm: 1200 Groß 8°, Original-Pappband (Hardcover), Deckel minimal gebogen, insgesamt gutes und innen sauberes Exemplar.

Condition: New.

Condition: New. pp. 672.

Paperback. Condition: Brand New. reprint edition. 672 pages. 9.60x6.70x1.50 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - In the late forties, Mathematical Programming became a scientific discipline in its own right. Since then it has experienced a tremendous growth. Beginning with economic and military applications, it is now among the most important fields of applied mathematics with extensive use in engineering, natural sciences, economics, and biological sciences. The lively activity in this area is demonstrated by the fact that as early as 1949 the first 'Symposium on Mathe matical Programming' took place in Chicago. Since then mathematical programmers from all over the world have gath ered at the intfrnational symposia of the Mathematical Programming Society roughly every three years to present their recent research, to exchange ideas with their colleagues and to learn about the latest developments in their own and related fields. In 1982, the XI. International Symposium on Mathematical Programming was held at the University of Bonn, W. Germany, from August 23 to 27. It was organized by the Institut fUr Okonometrie und Operations Re search of the University of Bonn in collaboration with the Sonderforschungs bereich 21 of the Deutsche Forschungsgemeinschaft. This volume constitutes part of the outgrowth of this symposium and docu ments its scientific activities. Part I of the book contains information about the symposium, welcoming addresses, lists of committees and sponsors and a brief review about the Ful kerson Prize and the Dantzig Prize which were awarded during the opening ceremony.…

Condition: New.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: New.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Condition: Brand New. new title edition. 392 pages. 10.00x7.25x1.00 inches. In Stock.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: gut. 1983. Mathematical Programming. The State of the Art. Bonn 1982. In deutscher Sprache. pages.

Condition: New. In English.

Hardcover. Condition: sehr gut. Originalpappband, 655 Seiten, 24,9 cm x 16,9 cm, with 30 figures, Ecken und Kanten teilweise leicht angestoßen, leicht angestaubt, so sehr gutes Exemplar Bonn 1982 in englischer Sprache.

Hardcover. Condition: Sehr gut. geringe lagerspuren, sonst sehr gut Lager a-987.

First Edition XII + 362 p., tables, formulas, bibliogr., index. (Orig. hardback. AS NEW) RARE AND SOUGHT AFTER EDITION This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs.…

Condition: new. Questo è un articolo print on demand.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the late forties, Mathematical Programming became a scientific discipline in its own right. Since then it has experienced a tremendous growth. Beginning with economic and military applications, it is now among the most important fields of applied mathematics with extensive use in engineering, natural sciences, economics, and biological sciences. The lively activity in this area is demonstrated by the fact that as early as 1949 the first 'Symposium on Mathe matical Programming' took place in Chicago. Since then mathematical programmers from all over the world have gath ered at the intfrnational symposia of the Mathematical Programming Society roughly every three years to present their recent research, to exchange ideas with their colleagues and to learn about the latest developments in their own and related fields. In 1982, the XI. International Symposium on Mathematical Programming was held at the University of Bonn, W. Germany, from August 23 to 27. It was organized by the Institut fUr Okonometrie und Operations Re search of the University of Bonn in collaboration with the Sonderforschungs bereich 21 of the Deutsche Forschungsgemeinschaft. This volume constitutes part of the outgrowth of this symposium and docu ments its scientific activities. Part I of the book contains information about the symposium, welcoming addresses, lists of committees and sponsors and a brief review about the Ful kerson Prize and the Dantzig Prize which were awarded during the opening ceremony. 672 pp. Englisch.…

Condition: New. Print on Demand pp. 672 30 Figures, 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 672.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -I. About the XIth International Symposium on Mathematical Programming.- Program and Organizing Committee.- Welcoming Addresses.- List of Sponsors.- The Fulkerson Prize and the Dantzig Prize 1982.- II. Mathematical Programming: The State of the Art - Bonn 1982.- Predictor-Corrector and Simplicial Methods for Approximating Fixed Points and Zero Points of Nonlinear Mappings.- Polyhedral Theory and Commutative Algebra.- Reminiscences About the Origins of Linear Programming.- Penalty Functions.- Applications of the FKG Inequality and its Relatives.- Semi-Infinite Programming and Applications.- Applications of Matroid Theory.- Recent Results in the Theory of Machine Scheduling.- Submodular Functions and Convexity.- Recent developments in Algorithms and Software for Trust Region Methods.- Variable Metric Methods for Constrained Optimization.- Polyhedral Combinatorics.- Generalized Equations.- Generalized Subgradients in Mathematical Programming.- Nondegeneracy Problems in Cooperative Game Theory.- Conic Methods for Unconstrained Minimization and Tensor Methods for Nonlinear Equations.- Min-Max Results in Combinatorial Optimization.- Generalized Gradient Methods of Non-Differentiable Optimization Employing Space Dilatation Operations.- The Problem of the Average Speed of the Simplex Method.- Solution of Large Linear Systems of Equations by Conjugate Gradient Type Methods.- Stochastic Programming: Solution Techniques and Approximation Schemes.- III. Scientific Program.- IV. List of Authors.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 672 pp. Englisch. …