Assignment problems / Rainer Burkard, Mauro Dell'Amico, Silvano Martello.

Format:

Book

Author/Creator:

Burkard, Rainer E.

Contributor:

Dell'Amico, Mauro.

Martello, Silvano.

Society for Industrial and Applied Mathematics.

Series:

Other titles in applied mathematics.

Other titles in applied mathematics

Language:

English

Subjects (All):

Assignment problems (Programming).

Computer science--Mathematics.

Computer science.

Physical Description:

1 electronic text (xxii, 393 p.) : ill., digital file.

Edition:

Rev. reprint.

Place of Publication:

Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2012.

Language Note:

English

System Details:

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Summary:

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 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. 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. Researchers will benefit from the book's 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:

Introduction

Theoretical foundations

Bipartite matching algorithms

Linear sum assignment problem

Further results on the linear sum assignment problem

Other types of linear assignment problems

Quadratic assignment problems: formulations and bounds

Quadratic assignment problems: algorithms

Other types of quadratic assignment problems

Multi-index assignment problems.

Notes:

"OTR106"--Spine.

Includes bibliographical references (p. 327-377) and indexes.

Title from title screen, viewed 02/15/2013.

ISBN:

1-61197-223-X

OCLC:

827790919

Publisher Number:

OT106 SIAM