Synopsis
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).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Handbook of Combinatorial Optimization: Supplement...
Image d'archives
Handbook of Combinatorial Optimization: Supplement Volume A
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190183401
Acheter neuf
EUR 159,33
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Handbook of Combinatorial Optimization: Supplement Volume A
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780792359241_new
Acheter neuf
EUR 157,71
Frais de port :
EUR 13,68
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Handbook of Combinatorial Optimization
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Gebunden. Etat : New. N° de réf. du vendeur 5969024
Acheter neuf
EUR 136,16
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Handbook of Combinatorial Optimization
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 660. N° de réf. du vendeur 26556596
Acheter neuf
EUR 197,78
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Handbook of Combinatorial Optimization
Edité par
Springer US Okt 1999, 1999
ISBN 10 : 0792359240
ISBN 13 : 9780792359241
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. dual heuristics). 660 pp. Englisch. N° de réf. du vendeur 9780792359241
Acheter neuf
EUR 181,89
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Handbook of Combinatorial Optimization | Supplement Volume A
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 102295079
Acheter neuf
EUR 141,90
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image d'archives
Handbook of Combinatorial Optimization
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand pp. 660 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 8372715
Acheter neuf
EUR 210,02
Frais de port :
EUR 7,42
De Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Handbook of Combinatorial Optimization
Edité par
Springer New York, Springer US Okt 1999, 1999
ISBN 10 : 0792359240
ISBN 13 : 9780792359241
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 660 pp. Englisch. N° de réf. du vendeur 9780792359241
Acheter neuf
EUR 160,49
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Handbook of Combinatorial Optimization
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 660. N° de réf. du vendeur 18556606
Acheter neuf
EUR 212,74
Frais de port :
EUR 9,95
De Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Handbook of Combinatorial Optimization : Supplement Volume A
Edité par
Springer US, Springer US, 1999
ISBN 10 : 0792359240
ISBN 13 : 9780792359241
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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). N° de réf. du vendeur 9780792359241
Acheter neuf
EUR 170,64
Frais de port :
EUR 65,72
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)