Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties - Tapa blanda
Sinopsis
, the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Complexity and Approximation: Combinatorial Optimization...
Imagen del vendedor
Complexity and Approximation
Publicado por
Springer Berlin Heidelberg Okt 2013, 2013
ISBN 10: 3642635814
ISBN 13: 9783642635816
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises. 548 pp. Englisch. Nº de ref. del artículo: 9783642635816
Comprar nuevo
EUR 74,89
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Complexity and Approximation
Publicado por
Springer Berlin Heidelberg, 2013
ISBN 10: 3642635814
ISBN 13: 9783642635816
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Comprehensive Assessment of numerous problems in combinatorial optimizationThis book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization probl. Nº de ref. del artículo: 5065873
Comprar nuevo
EUR 64,33
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Complexity and Approximation
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. xx + 524. Nº de ref. del artículo: 26142287653
Comprar nuevo
EUR 110,39
Gastos de envío:
EUR 3,46
A Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Complexity and Approximation
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Print on Demand pp. xx + 524. Nº de ref. del artículo: 135044346
Comprar nuevo
EUR 112,63
Gastos de envío:
EUR 7,41
De Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Complexity and Approximation
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. xx + 524. Nº de ref. del artículo: 18142287663
Comprar nuevo
EUR 116,23
Gastos de envío:
EUR 9,95
De Alemania a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 548 pages. 9.50x7.10x1.00 inches. In Stock. Nº de ref. del artículo: 3642635814
Comprar nuevo
EUR 119,93
Gastos de envío:
EUR 14,24
De Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Complexity and Approximation
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2013, 2013
ISBN 10: 3642635814
ISBN 13: 9783642635816
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Neuware -N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 548 pp. Englisch. Nº de ref. del artículo: 9783642635816
Comprar nuevo
EUR 74,89
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties | Giorgio Ausiello (u. a.) | Taschenbuch | xx | Englisch | 2013 | Springer | EAN 9783642635816 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 105637818
Comprar nuevo
EUR 66,85
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Publicado por
Springer Berlin Heidelberg, 2013
ISBN 10: 3642635814
ISBN 13: 9783642635816
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems. Nº de ref. del artículo: 9783642635816
Comprar nuevo
EUR 74,89
Gastos de envío:
EUR 65,26
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA75836426358145
Comprar usado
EUR 133,78
Gastos de envío:
EUR 28,48
De Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles