Assignment Problems
$116.00 (P)
- 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: 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)
Hardback
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 collegesales@cambridge.org providing details of the course you are teaching.
-
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.
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
- 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
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.
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.
×