Nonlinear Assignment Problems: Algorithms and Applications

✍ Scribed by Frits C. R. Spieksma (auth.), Panos M. Pardalos, Leonidas S. Pitsoulis (eds.)

• Publisher: Springer US
• Year: 2000
• Tongue: English
• Leaves: 316
• Series: Combinatorial Optimization 7
• Edition: 1
• Category: Library

✦ Synopsis

Nonlinear 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. The purpose of this book is to provide in a single volume, major algorithmic aspects and applications of NAPs as contributed by leading 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.
Audience: Researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science.

✦ Table of Contents

Front Matter....Pages i-xxiii
Multi Index Assignment Problems: Complexity, Approximation, Applications....Pages 1-12
Multidimensional Assignment Problems Arising in Multitarget and Multisensor Tracking....Pages 13-38
Target-Based Weapon Target Assignment Problems....Pages 39-53
The Nonlinear Assignment Problem in Experimental High Energy Physics....Pages 55-89
Polyhedral Methods for Solving Three Index Assignment Problems....Pages 91-107
Polyhedral Methods for the QAP....Pages 109-141
Semidefinite Programming Approaches to the Quadratic Assignment Problem....Pages 143-174
Heuristics for Nonlinear Assignment Problems....Pages 175-215
Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines....Pages 217-243
Decomposition Algorithms for Communication Minimization in Parallel Computing....Pages 245-302
Back Matter....Pages 303-303

✦ Subjects

Processor Architectures; Theory of Computation; Mathematical Modeling and Industrial Mathematics; Calculus of Variations and Optimal Control; Optimization; Optimization