Assignment Problems
2nd Edition
£91.99
- 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
£
91.99
Hardback
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×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.-
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×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.
×