• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Nonlinear Assignment Problems: Algorithms and Applications

Nonlinear Assignment Problems: Algorithms and Applications

Hardcover

Series: Combinatorial Optimization, Book 7

Medical ReferenceGeneral ComputersProgramming

ISBN10: 0792366468
ISBN13: 9780792366461
Publisher: Springer Nature
Published: Nov 30 2000
Pages: 304
Weight: 1.43
Height: 0.90 Width: 7.06 Depth: 9.16
Language: English
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.

1 different editions

Also available

Also in

Programming