Graph theory combinatorial optimization (35 resultados)

- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 117,41
Envío por EUR 14,10Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.

- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 125,49
Envío por EUR 14,10Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.

Graph Theory and Combinatorial Optimization (Gerad 25th Anniversary)
Avis, David [Editor]; Hertz, Alain [Editor]; Marcotte, Odile [Editor];
- Tapa dura
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de AmericaBennettBooksLtd
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 139,89
Envío por EUR 6,08Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: New. In shrink wrap. Looks like an interesting title.

- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 148,45
Envío por EUR 3,49Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 284.

- Tapa blanda
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 161,28
Envío por EUR 3,49Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 284.
Más imágenes- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 95,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Graph Theory and Combinatorial Optimization | David Avis (u. a.) | Taschenbuch | xvi | Englisch | 2010 | Springer | EAN 9781441938114 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 111,53
Envío por EUR 62,96Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniq…ues have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.

- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 112,77
Envío por EUR 62,18Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its…techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.

- Tapa dura
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 184,20
Envío por EUR 29,41Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Thulasiraman, Krishnaiyan (EDT); Nishizeki, Takao (EDT); Brandstadt, Andreas (EDT); Arumugam, Subramanian (EDT)
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 329,42
Envío por EUR 2,31Se envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: As New. Unread book in perfect condition.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Thulasiraman, Krishnaiyan (EDT); Nishizeki, Takao (EDT); Brandstadt, Andreas (EDT); Arumugam, Subramanian (EDT)
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 322,63
Envío por EUR 17,65Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: As New. Unread book in perfect condition.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Thulasiraman, Krishnaiyan (EDT); Nishizeki, Takao (EDT); Brandstadt, Andreas (EDT); Arumugam, Subramanian (EDT)
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 358,18
Envío por EUR 2,31Se envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: New.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Thulasiraman, Krishnaiyan (EDT); Nishizeki, Takao (EDT); Brandstadt, Andreas (EDT); Arumugam, Subramanian (EDT)
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 368,64
Envío por EUR 17,65Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: New.

- Tapa dura
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 437,64
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a u…nified, comprehensive treatment of both graph theory and combinatorial optimization.Divided into 11 cohesive sections, the handbooks 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to: Understand phenomena as shaped by their graph structuresDevelop needed algorithmic and optimization tools for the study of graph structuresDesign and plan graph structures that lead to certain desirable behavior With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks. Since the 1970s, many engineering disciplines have relied extensively on graph theory as a primary tool for analysis and design. The Handbook of Graph Algorithms, Volume 1: Theory and Optimization provides comprehensive coverage of basic concepts and recent developments in the field. Focusing on design, proof of correctness, and complexity analysis, this volume presents a detailed discussion of algorithms that are useful in a variety of applications and provides an authoritative review of the current state of the art. Using figures to help illustrate the concepts, the book examines topics such as incremental algorithms and online algorithms that have yet to receive much attention but have great potential for future applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

- Tapa dura
- Primera edición
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 419,53
Envío por EUR 10,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: New. Series: Chapman & Hall/CRC Computer & Information Science Series. Num Pages: 1244 pages, 345 black & white illustrations, 21 black & white tables. BIC Classification: PBV. Category: (G) General (US: Trade). Dimension: 279 x 216. . . 2015. 1st Edition. Hardcover. . . . .

- Tapa dura
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 534,58
Envío por EUR 9,19Se envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: New. Series: Chapman & Hall/CRC Computer & Information Science Series. Num Pages: 1244 pages, 345 black & white illustrations, 21 black & white tables. BIC Classification: PBV. Category: (G) General (US: Trade). Dimension: 279 x 216. . . 2015. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms: Theory and Optimization: Vol 1
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 567,32
Envío por EUR 29,41Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Brand New. 1st edition. 1216 pages. 9.56x6.60x0.75 inches. In Stock.

- Tapa dura
Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 726,63
Envío por EUR 32,38Se envía de Australia a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a u…nified, comprehensive treatment of both graph theory and combinatorial optimization.Divided into 11 cohesive sections, the handbooks 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to: Understand phenomena as shaped by their graph structuresDevelop needed algorithmic and optimization tools for the study of graph structuresDesign and plan graph structures that lead to certain desirable behavior With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks. Since the 1970s, many engineering disciplines have relied extensively on graph theory as a primary tool for analysis and design. The Handbook of Graph Algorithms, Volume 1: Theory and Optimization provides comprehensive coverage of basic concepts and recent developments in the field. Focusing on design, proof of correctness, and complexity analysis, this volume presents a detailed discussion of algorithms that are useful in a variety of applications and provides an authoritative review of the current state of the art. Using figures to help illustrate the concepts, the book examines topics such as incremental algorithms and online algorithms that have yet to receive much attention but have great potential for future applications. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 35,89
Envío por EUR 60,69Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In combinatorics, the Narayana numbers N, form a triangle of natural numbers, called Narayana triangle, that occur in various counting problems. They are named for Narayana, a mathematician fro…m India. The Narayana numbers can be expressed in terms of binomial coefficients. An example of a counting problem whose solution can be given in terms of the Narayana numbers N, is the number of expressions containing n pairs of parentheses which are correctly matched and which contain k distinct nestings. For instance, with four pairs of parentheses six sequences can be created which each contain two times the sub-pattern.

- Tapa blanda
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 94,25
Envío por EUR 5,50Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 46,20
Envío por EUR 61,08Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the…length is the sum of the lengths of all edges. The difference between the Steiner tree problem and the minimum spanning tree problem is that, in the Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices. It has been proved that the resulting connection is a tree, known as the Steiner tree. There may be several Steiner trees for a given set of initial vertices.

- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 106,99
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathemat…ics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise. 280 pp. Englisch.

- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 106,99
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied m…athematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise. 284 pp. Englisch.

- Tapa dura
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 89,99
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A current treatment of cutting-edge topics in Graph Theory and Combinatorial Optimization by leading researchersIncludes heuristic advances and novel approaches to solving combinatorial optimization problems…Graph theory is very much tie.

- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 98,54
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A current treatment of cutting-edge topics in Graph Theory and Combinatorial Optimization by leading researchersIncludes heuristic advances and novel approaches to solving combinatorial optimization problemsGraph theo…ry is very much tie.

- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 154,86
Envío por EUR 7,65Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 284 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Más imágenes- Tapa dura
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 93,35
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Buch. Condición: Neu. Graph Theory and Combinatorial Optimization | David Avis (u. a.) | Buch | Mathematics of Decision Making | xvi | Englisch | 2005 | Springer | EAN 9780387255910 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter:… preigu Print on Demand.

- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 154,92
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 284.

- Tapa dura
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 106,99
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics.… Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch.

- Tapa blanda
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 169,39
Envío por EUR 7,65Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 284 26 Illus.