I want this title to be available as an eBook

Assignment Problems

2nd Edition

Authors:
Rainer Burkard, Technische Universität Graz, Austria
Mauro Dell'Amico, Università degli Studi di Modena, Italy
Silvano Martello, Università degli Studi, Bologna, Italy

Date Published: December 2012
availability: Available in limited markets only
format: Hardback
isbn: 9781611972221

Rate & review

Hardback

Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Description

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.
- 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

Log in 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?

Reviews must contain at least 12 words about the product.

×

Product details
- Edition: 2nd Edition
- Date Published: December 2012
- format: Hardback
- isbn: 9781611972221
- length: 415 pages
- dimensions: 261 x 182 x 23 mm
- weight: 0.89kg
- availability: Available in limited markets only
Table of Contents
Preface
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
Bibliography
Author index
Subject index.
Resources for

Assignment Problems

Rainer Burkard, Mauro Dell'Amico, Silvano Martello
General Resources
- Resources
Find resources associated with this title
Back to resources home

Your search for '' returned .
Type Name Unlocked * Format Size

Showing of

Back to top

This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

If you are having problems accessing these resources please contact lecturers@cambridge.org.
Authors
Rainer Burkard, Technische Universität Graz, Austria
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, 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 optimisation 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 (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.