0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Nonlinear Assignment Problems - Algorithms and Applications (Hardcover, 2001 ed.): Panos M. Pardalos, L.S. Pitsoulis Nonlinear Assignment Problems - Algorithms and Applications (Hardcover, 2001 ed.)
Panos M. Pardalos, L.S. Pitsoulis
R4,049 Discovery Miles 40 490 Ships in 18 - 22 working days

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.

Nonlinear Assignment Problems - Algorithms and Applications (Paperback, Softcover reprint of hardcover 1st ed. 2001): Panos M.... Nonlinear Assignment Problems - Algorithms and Applications (Paperback, Softcover reprint of hardcover 1st ed. 2001)
Panos M. Pardalos, L.S. Pitsoulis
R4,045 Discovery Miles 40 450 Ships in 18 - 22 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Language: A Biological Model
Ruth Garrett Millikan Hardcover R4,099 Discovery Miles 40 990
Neuropsychological Assessment in the Age…
Stephen C. Bowden Hardcover R2,847 Discovery Miles 28 470
Agile Project Management - How to Make…
James Edge Hardcover R655 R584 Discovery Miles 5 840
Thinking, Fast And Slow
Daniel Kahneman Paperback  (3)
R380 R339 Discovery Miles 3 390
The Character of Consciousness
David J. Chalmers Hardcover R4,145 Discovery Miles 41 450
Principles of Security and Trust - 7th…
Lujo Bauer, Ralf Kusters Hardcover R1,547 Discovery Miles 15 470
Research Anthology on Usage and…
Information R Management Association Hardcover R17,611 Discovery Miles 176 110
Foundations of Multi-Paradigm Modelling…
Paulo Carreira, Vasco Amaral, … Hardcover R1,444 Discovery Miles 14 440
Programming Logic & Design…
Joyce Farrell Paperback R1,256 R1,170 Discovery Miles 11 700
Cognitive Psychology - EMEA Edition
E. Bruce Goldstein, Johanna C. van Hooff Paperback R1,315 R1,223 Discovery Miles 12 230

 

Partners