Assignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 2nd edition. 415 pages. 10.25x7.25x1.00 inches. In Stock. Seller Inventory # __1611972221
Quantity: 1 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9781611972221
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 18683357
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 18683357-n
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: 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. . . . . . Seller Inventory # V9781611972221
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 3 working days. Seller Inventory # B9781611972221
Quantity: 1 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: 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. Seller Inventory # LU-9781611972221
Seller: moluna, Greven, Germany
Gebunden. Condition: New. A comprehensive guide to practical and theoretic aspects of assignment problems, suitable for researchers and practitioners.InhaltsverzeichnisPreface 1. Introduction 2. Theoretical foundations 3. Bipartite matching algorithms 4. . Seller Inventory # 596415858
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: 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. Seller Inventory # V9781611972221
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Neuware - A comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised 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. Seller Inventory # 9781611972221