A comprehensive guide to practical and theoretic aspects of assignment problems, suitable for researchers and practitioners.
"Sinopsis" puede pertenecer a otra edición de este libro.
Rainer Burkard is Professor Emeritus of Mathematics at Graz University of Technology, Austria. He has published several books and over 150 papers on discrete optimisation and related areas. His main research focus is combinatorial optimisation and its applications.
Mauro Dell'Amico is a Professor of Operations Research at the University of Modena and Reggio Emilia, Italy. His research interests are combinatorial optimisation as applied to transportation, telecommunications, routing and scheduling.
Silvano Martello is a Professor of Operations Research at the University of Bologna, Italy. He is author of Knapsack Problems: Algorithms and Computer Implementations (1990) and Editor-in-Chief of 4OR: A Quarterly Journal of Operations Research. His research focus is the design of algorithms for combinatorial optimisation and graph theory problems and their application in packing, routing and scheduling.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. 2012. 2nd Edition. Hardcover. A comprehensive guide to practical and theoretic aspects of assignment problems, suitable for researchers and practitioners. Num Pages: 415 pages, illustrations. BIC Classification: PBD; PBF. Category: (U) Tertiary Education (US: College). Dimension: 185 x 262 x 24. Weight in Grams: 900. . . . . . Nº de ref. del artículo: V9781611972221
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 18683357
Cantidad disponible: 2 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 18683357-n
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 18683357
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 18683357-n
Cantidad disponible: 2 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Hardback. Condición: New. Second Revised Edition. Provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems.Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Nº de ref. del artículo: LU-9781611972221
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 2nd edition. 415 pages. 10.25x7.25x1.00 inches. In Stock. Nº de ref. del artículo: __1611972221
Cantidad disponible: 1 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. 2012. 2nd Edition. Hardcover. A comprehensive guide to practical and theoretic aspects of assignment problems, suitable for researchers and practitioners. Num Pages: 415 pages, illustrations. BIC Classification: PBD; PBF. Category: (U) Tertiary Education (US: College). Dimension: 185 x 262 x 24. Weight in Grams: 900. . . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9781611972221
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. New copy - Usually dispatched within 4 working days. Nº de ref. del artículo: B9781611972221
Cantidad disponible: 2 disponibles
Librería: Rarewaves.com UK, London, Reino Unido
Hardback. Condición: New. Second Revised Edition. Provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems.Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Nº de ref. del artículo: LU-9781611972221
Cantidad disponible: 1 disponibles