Nonlinear Assignment Problems
Subtitle: Algorithms and Applications
By: edited by Panos M. Pardalos, Leonidas S. Pitsoulis
Contributors: Pitsoulis, Leonidas S.
Series: Combinatorial Optimization -- 7; Combinatorial optimization -- 7.
Publisher: Springer US
Published: 2000
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] :
Number of pages: 303
ISBN-13: 9781441948410; 9781475731552
Subjects: Mathematical optimization; Information theory; Computer science
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.