Don't forget to bookmark this web site !!
Used & Out of Print Books | Contact us | Home

Browse and Compare Price at 40+ Sites and 20,000+ Stores!!

|  FAQ/About us |  Recommend us |  Browse |  Memo |  Book Reviews |  Random Quotes |  Help |

 

Find more info., search and price compare for
Assignment Problems
by Rainer Burkard ; Mauro Dell'Amico ; Silvano Martello
Binding: Hardcover, 402 pages
Publisher: Society for Industrial and Applied Mathematics
Weight: 1.85 pound
Dimension: H: 0.9 x L: 10.2 x W: 7.1 inches
ISBN 10: 0898716632
ISBN 13: 9780898716634
Click here to search for this book and compare price at 40+ bookstores with AddALL.com!

If you cannot find this book in our new and in print search, be sure to try our used and out of print search too!

 

Book Description:
This book 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.

Audience: Assignment Problems is a useful tool for researchers, practitioners, and graduate students. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its many 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.

Contents: Preface; Chapter 1: Introduction; Chapter 2: Theoretical Foundations; Chapter 3: Bipartite Matching Algorithms; Chapter 4: Linear Sum Assignment Problem; Chapter 5: Further Results on the Linear Sum Assignment Problem; Chapter 6: Other Types of Linear Assignment Problems; Chapter 7: Quadratic Assignment Problems: Formulations and Bounds; Chapter 8: Quadratic Assignment Problems: Algorithms; Chapter 9: Other Types of Quadratic Assignment Problems; Chapter 10: Multi-index Assignment Problems; Bibliography; Author Index; Subject Index


|  Home |  FAQ/About us |  Link to us |  Recommend us |  Contact us |  Bookstores |  Memo |

Shipping Destination:
State:
(US only)
Display in:
Search by:

Searching for Out of Print Books? [Click Here]

[ For web hosting, AddALL recommend Liquidweb]