|
![]() |
|||
|
||||
OverviewNonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. This work provides major algorithmic aspects and applications of NAPs as contributed by international experts. The chapters included in this book are concerned with major applications and the latest algorithmic solution approaches for NAPs. Approximation algorithms, polyhedral methods, semidefinite programming approaches and heuristic procedures for NAPs are included, while applications of this problem class in the areas of multiple-target tracking in the context of military surveillance systems, of experimental high energy physics, and of parallel processing are presented. This work shoudl appeal to researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science. Full Product DetailsAuthor: Panos M. Pardalos , L.S. Pitsoulis , Panos M. PardalosPublisher: Springer Imprint: Springer Edition: 2001 ed. Volume: 7 Dimensions: Width: 15.50cm , Height: 1.90cm , Length: 23.50cm Weight: 0.664kg ISBN: 9780792366461ISBN 10: 0792366468 Pages: 304 Publication Date: 30 November 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of Contents1 Multi Index Assignment Problems: Complexity, Approximation, Applications.- 2 MD Assignment of Data Association.- 3 Target-Based Weapon Target Assignment Problems.- 4 The Nonlinear Assignment Problem in Experimental High Energy Physics.- 5 Three Index Assignment Problem.- 6 Polyhedral Methods for the QAP.- 7 Semidefinite Programming Approaches to the Quadratic Assignment Problem.- 8 Heuristics for Nonlinear Assignment Problems.- 9 Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines.- 10 Decomposition Algorithms for Communication Minimization in Parallel Computing.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |