Isbn: 9780792366461 - nonlinear assignment problems: algorithms and applications: 7 (11 risultati)

Condizione: New. In English.

Condizione: New. Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem. This work provides major algorithmic aspects and applications of NAPs as contributed by international experts. Approximation algorithms and semi-definite programming approaches are included. Editor(s): Pardalos, Panos M.; Pitsoulis, Leonidas S. Series: Combinatorial Optimization. Num Pages: 328 pages, biography. BIC Classification: PBU; UNC; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 19. Weight in Grams: 642. . 2000. Hardback. . . . .…

Condizione: New. pp. 332.

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

Condizione: New. Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem. This work provides major algorithmic aspects and applications of NAPs as contributed by international experts. Approximation algorithms and semi-definite programming approaches are included. Editor(s): Pardalos, Panos M.; Pitsoulis, Leonidas S. Series: Combinatorial Optimization. Num Pages: 328 pages, biography. BIC Classification: PBU; UNC; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 19. Weight in Grams: 642. . 2000. Hardback. . . . . Books ship from the US and Ireland.…

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 332 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 so.…

Buch. Condizione: Neu. nach der Bestellung gedruckt 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.…

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 332 pp. Englisch.…

Condizione: New. Print on Demand pp. 332 Illus.

Condizione: New. PRINT ON DEMAND pp. 332.