Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 163,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 161,97
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 164,83
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 164,81
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 200,09
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . .
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 219,98
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 660.
EUR 180,97
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 1999
ISBN 10: 0792359240 ISBN 13: 9780792359241
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 253,82
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . . Books ship from the US and Ireland.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 248,72
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 258,28
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 283,69
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 224,59
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. 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).
Librería: Majestic Books, Hounslow, Reino Unido
EUR 230,93
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: 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.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 232,11
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 660.