Synopsis "nonlinear assignment problems"

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.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews