11%OFF
Stock image for illustration purposes only - book cover, edition or condition may vary.
Assignment Problems
Rainer Burkard
€ 125.80
€ 112.41
FREE Delivery in Ireland
Description for Assignment Problems
Hardback. 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.
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.
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.
Product Details
Format
Hardback
Publication date
2012
Publisher
Society for Industrial & Applied Mathematics,U.S. United States
Number of pages
415
Condition
New
Number of Pages
415
Place of Publication
New York, United States
ISBN
9781611972221
SKU
V9781611972221
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-1
About Rainer Burkard
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.