My Account | Home| Bulletin Board| Cart | Help
Close Session
IISER-KIndian Institute of Science Education & Research - Kolkata
Quick Search
Search Terms:
All Documents
Books
Newspapers
Periodicals
Articles
Theses
E-Books
Database : IISERK

Set Session Filters
Login to ask the library to add a book.
Active Filter Settings
No Active Filters
There are 0 titles in your cart.

Search History
Special Collections: Maps
Recommended Reading
first record | previous record | next record | last record
full | marc
Record 1 of 1
  Total Requests  0      Unsatisfied Requests  0
You searched IISERK - Subject: Cognitive Psychology
Request
Call Number 519.7/2
Author Burkard, Rainer E.
Title Assignment problems [electronic resource] / Rainer Burkard, Mauro Dell'Amico, Silvano Martello.
Publication Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2009.
Material Info. 1 electronic text (xx, 382 p.) : ill., digital file.
Summary Note 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.
Notes Includes bibliographical references (p. 319-366) and indexes.
Notes 1. Introduction -- 2. Theoretical foundations -- 3. Bipartite matching algorithms -- 4. Linear sum assignment problem -- 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.
ISBN 9780898717754 (electronic bk.)
Subject Assignment problems (Programming)
Subject Computer science Mathematics.
Subject Combinatorial optimization
Subject Linear Assignment
Subject Quadratic Assignment
Subject Matching
Subject Algorithms
Added Entry Dell'Amico, Mauro.
Added Entry Martello, Silvano.
Added Entry Society for Industrial and Applied Mathematics.
Date Year, Month, Day:01405141
Link SIAM

Keyword Search

 Words: Search Type:
 
 

Database: IISERK

Any filter options that are chosen below will be combined with the Session Filters and applied to the search.
Nature of Contents Filters Format Filters

Including Excluding

Including Excluding
Language Filters Place of Publication Filters

Including Excluding

Including Excluding
Publication Date Context Date
  -     -  

Set Session Filters
Select below to return to the last:
Copyright © 2014 VTLS Inc. All rights reserved.
VTLS.com