Skip to content

All SAP systems will be unavailable on Saturday 10th December 2022 from 0800-1800 UK Time.

If you can’t place an order, please contact Customer Services to complete your order.

UK/ROW +44 (0) 1223 326050 | US 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Register Sign in Wishlist
Assignment Problems

Assignment Problems

$116.00 (P)

  • Date Published: March 2009
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Hardback
  • isbn: 9780898716634

$ 116.00 (P)

This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Unavailable Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Assignment Problems is a useful tool for researchers, practitioners, and graduate students. It 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 organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters 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. 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 discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.

    • Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems
    • An associated webpage offers applets that readers can use to execute some of the basic algorithms
    • Comprehensive treatment of assignment problems from their conception through to their present-day developments
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: March 2009
    • format: Hardback
    • isbn: 9780898716634
    • length: 395 pages
    • dimensions: 260 x 182 x 23 mm
    • weight: 0.87kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    1. Introduction
    2. Theoretical foundations
    3. Bipartite matching algorithms
    4. Linear sum assignment problem: sequential algorithms
    5. Further results on the linear sum assignment problem
    6. Other types of linear assignment problems
    7. Quadratic assignment problems: formulations and bounds
    8. Quadratic assignment problems: algorithms
    9. Other types of quadratic assignment problems
    10. Multi-index assignment problems
    Author index
    Subject index.

  • Authors

    Rainer Burkard, Technische Universität Graz, Austria
    Rainer Burkard is a Professor of Mathematics at Graz University of Technology, Austria. He has published several books and over 150 papers on discrete optimization and related areas, and he serves as an editor for numerous journals in discrete applied mathematics. His main research focus is combinatorial optimization and its applications.

    Mauro Dell'Amico, Università degli Studi di Modena, Italy
    Mauro Dell'Amico is a Professor of Operations Research at the University of Modena and Reggio Emilia, Italy. His research interests are combinatorial optimization as applied to transportation, telecommunications, routing, and scheduling.

    Silvano Martello, Università degli Studi, Bologna, Italy
    Silvano Martello is a Professor of Operations Research at the University of Bologna, Italy. He is author of Knapsack Problems: Algorithms and Computer Implementations (Wiley, 1990) and Editor-in-Chief of 4OR: A Quarterly Journal of Operations Research. His research focus is the design of algorithms for combinatorial optimization and graph theory problems and their application in packing, routing, and scheduling.

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.