Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 39,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 45,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 43,79
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 54,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 70,81
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 165 pages. 9.00x6.00x0.25 inches. In Stock.
Librería: Great Matter Books, Grand Rapids, MI, Estados Unidos de America
EUR 81,15
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: As New. Book is As New, no flaws. All of our books are individually inspected and described. Never ex-library unless explicitly described as such.
EUR 97,41
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 117,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 116,53
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 131,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 116,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 119,98
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, US, 2000
ISBN 10: 0792361105 ISBN 13: 9780792361107
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 149,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 2000 ed. Presenting a set of contributions by the most influential authors on the Steiner Tree problem, the authors of this text address the latest concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. The book is intended for advanced undergraduates, graduates and research scientists in combinational optimization and computer science. It is divided into two sections: Part I includes papers on the general geometric Steiner Tree problem in the plane and higher dimensions; Part II includes papers on the Steiner problem on graphs which has significant import to Steiner Tree applications.
EUR 148,68
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 336.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2000
ISBN 10: 0792361105 ISBN 13: 9780792361107
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 135,57
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Presents a set of contributions by the most influential authors on the Steiner Tree problem. The authors address the various concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. Editor(s): Du, Ding-Zhu; Smith, J.M. (Dept. of Industrial Engineering, University of Massachusetts, USA); Rubinstein, J. Hyam. Series: Combinatorial Optimization. Num Pages: 335 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 20. Weight in Grams: 653. . 2000. Hardback. . . . .
EUR 150,20
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 340.
EUR 155,11
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 336 pages. 9.00x6.00x0.76 inches. In Stock.
EUR 95,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Advances in Steiner Trees | Ding-Zhu Du (u. a.) | Taschenbuch | Combinatorial Optimization | xii | Englisch | 2010 | Springer | EAN 9781441948243 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 145,53
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2000
ISBN 10: 0792361105 ISBN 13: 9780792361107
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 171,41
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Presents a set of contributions by the most influential authors on the Steiner Tree problem. The authors address the various concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. Editor(s): Du, Ding-Zhu; Smith, J.M. (Dept. of Industrial Engineering, University of Massachusetts, USA); Rubinstein, J. Hyam. Series: Combinatorial Optimization. Num Pages: 335 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 20. Weight in Grams: 653. . 2000. Hardback. . . . . Books ship from the US and Ireland.
EUR 114,36
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
EUR 114,36
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
Librería: Rarewaves.com UK, London, Reino Unido
EUR 140,30
Cantidad disponible: Más de 20 disponibles
Añadir al carritoBook. Condición: New. 2000th.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 192,44
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 225,90
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642315631 ISBN 13: 9783642315633
Librería: moluna, Greven, Alemania
EUR 35,17
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extras1 Elliptic 3-manifolds and the Smale Conjecture.- 2 Diffeomorphisms and Embeddings of Manifolds.- 3 The Method of Cerf and Palais.- 4 Elliptic 3-manifolds Containing One-sided Klein Bottles.- 5 Lens S.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 86,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem. 340 pp. Englisch.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem. 336 pp. Englisch.
Librería: moluna, Greven, Alemania
EUR 92,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Stein.