Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Assignment Problems

All titles
Assignment Problems

Assignment Problems

2nd Edition
Rainer Burkard, Technische Universität Graz, Austria
Mauro Dell'Amico, Università degli Studi di Modena, Italy
Silvano Martello, Università degli Studi, Bologna, Italy
December 2012
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Hardback
9781611972221
NZD$280.95
inc GST
Hardback
    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

    Product details

    December 2012
    Hardback
    9781611972221
    415 pages
    261 × 182 × 23 mm
    0.89kg
    This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.

    Often bought together

    Surveys in Combinatorics 2005
    Surveys in Combinatorics 2005

    : Paperback

    Computation and Automata
    Computation and Automata

    : Hardback

    Combinatorics and Probability
    Combinatorics and Probability

    : Hardback

    Abstract Chiral Polytopes
    Abstract Chiral Polytopes

    : Hardback

    Often bought together

    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Theory and Practice of Logic Programming
    Theory and Practice of Logic Programming

    : Journal

    Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to all of them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, nonmonotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.

    Journal of Functional Programming
    Journal of Functional Programming

    : Journal

    Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. Special tracks are devoted to tools and applications, commercial uses and education; pearl-type papers are encouraged. For more details see the Advice for Authors page..Manuscripts for consideration in the Journal of Functional Programming should be submitted electronically, via Scholar One ManuscriptsTM:  http://mc.manuscriptcentral.com/cup/jfp_submit. See Instructions for Contributors.

    Related Journals

    Also by this Author

    Contents

    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.
      • Show more
    Courses
    Resources
    Resources for
    Type
    Visit the authors' website for this book
    Additional Information
    About the authors
      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.

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services