Idioma: Inglés
Publicado por Springer, 2004
Librería: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Alemania
Miembro de asociación: GIAQ
EUR 6,90
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Wie neu. 402 S., Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 980.
Librería: ALLBOOKS1, Direk, SA, Australia
EUR 52,34
Cantidad disponible: 12 disponibles
Añadir al carritoBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 157,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 157,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 158,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 158,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 178,14
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. The material presented in this supplement to the 3-volume Handbook of Combinatorial Optimization will be useful for any researcher who uses combinatorial optimization methods to solve problemsThe material presented in this supplement to the 3-volume .
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 166,41
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).
Idioma: Inglés
Publicado por Springer US, Springer US, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 170,64
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).
Librería: Revaluation Books, Exeter, Reino Unido
EUR 231,29
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. supplement edition. 408 pages. 9.61x6.61x1.97 inches. In Stock.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 235,26
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. supplement edition. 656 pages. 9.25x6.25x1.49 inches. In Stock.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 233,80
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 245,61
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: ALLBOOKS1, Direk, SA, Australia
EUR 112,10
Cantidad disponible: 1 disponibles
Añadir al carritoBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 156,53
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 157,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 158,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 164,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied ma- ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, a- line crew scheduling, corporate planning, computer-aided design and m- ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, allo- tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discov- ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These al- rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In ad- tion, linear programming relaxations are often the basis for many appro- mation algorithms for solving NP-hard problems (e.g. dual heuristics).
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 217,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 240,88
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 247,94
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems.
Librería: preigu, Osnabrück, Alemania
EUR 141,30
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Handbook of Combinatorial Optimization | Supplement Volume A | Panos M. Pardalos (u. a.) | Buch | viii | Englisch | 1999 | Springer US | EAN 9780792359241 | 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.
Librería: preigu, Osnabrück, Alemania
EUR 141,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Handbook of Combinatorial Optimization | Supplement Volume B | Taschenbuch | viii | Englisch | 2011 | Springer | EAN 9781441936660 | 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.