ISBN: 9783764363512 - polytopes - combinatorics and computation: 29 (19 risultati)

Condizione: 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.…

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Paperback or Softback. Condizione: New. Polytopes - Combinations and Computation. Book.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Softcover. Condizione: Gut. 225 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-05099 9783764363512 Sprache: Englisch Gewicht in Gramm: 550.

Condizione: Gut. 227 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7968 9783764363512 Sprache: Englisch Gewicht in Gramm: 900.

Condizione: New. Editor(s): Kalai, Gil; Ziegler, Gunter M. Series: Oberwolfach Seminars. BIC Classification: PBM. Dimension: 240 x 170. Weight in Grams: 443. . 2000. Paperback. . . . .

Softcover: 17 x 1.3 x 24 cm. 232 p. Unread book. Like new! 9783764363512 Sprache: Englisch Gewicht in Gramm: 508.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs.…

Condizione: New. Editor(s): Kalai, Gil; Ziegler, Gunter M. Series: Oberwolfach Seminars. BIC Classification: PBM. Dimension: 240 x 170. Weight in Grams: 443. . 2000. Paperback. . . . . Books ship from the US and Ireland.

Paperback. Condizione: Brand New. 1st edition. 225 pages. 9.25x6.50x0.50 inches. In Stock.

Paperback. Condizione: New. In shrink wrap. Looks like an interesting title.

PF. Condizione: 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. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs. 232 pp. Englisch.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 232 pp. Englisch.…