Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 53,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 49,88
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 158,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 160,54
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 159,34
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 157,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 157,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 157,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 177,63
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 178,32
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 141,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. The Quadratic Assignment Problem | Theory and Algorithms | E. Cela | Taschenbuch | xv | Englisch | 2010 | Humana | EAN 9781441947864 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
EUR 119,47
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
Publicado por Springer US, Springer US, 2010
ISBN 10: 1441947868 ISBN 13: 9781441947864
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 166,62
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Publicado por Springer US, Springer US, 1997
ISBN 10: 0792348788 ISBN 13: 9780792348788
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 168,73
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 234,80
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 304 pages. 9.00x6.30x0.69 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 141,30
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. The Quadratic Assignment Problem | Theory and Algorithms | E. Cela | Buch | xv | Englisch | 1997 | Springer US | EAN 9780792348788 | 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.