nonlinear assignment problems algorithms (9 Ergebnisse)

Hardcover. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. First Edition. An ex-library copy in original laminated blue and white hard covers. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 328 | Sprache: Englisch | Produktart: Bücher | 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.

Zustand: New. In.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Nonlinear Assignment Problems | Algorithms and Applications | Panos M. Pardalos (u. a.) | Taschenbuch | Combinatorial Optimization | xxiv | Englisch | 2010 | Springer | EAN 9781441948410 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Zustand: Brand New. 328 pages. 9.00x6.25x0.74 inches. In Stock.

Hardcover. Zustand: Brand New. 1st edition. 302 pages. 9.50x6.25x0.75 inches. In Stock.