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,269 Discovery Miles 42 690 Ships in 10 - 15 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,265 Discovery Miles 42 650 Ships in 10 - 15 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...
Moving On Skiffle
Van Morrison CD R505 Discovery Miles 5 050
Multi-Functional Bamboo Standing Laptop…
 (1)
R995 R399 Discovery Miles 3 990
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Samurai Sword Murder - The Morne Harmse…
Nicole Engelbrecht Paperback R330 R284 Discovery Miles 2 840
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
One Pot - Cookbook for South Africans
Louisa Holst Paperback R385 R280 Discovery Miles 2 800
Mountain Backgammon - The Classic Game…
Lily Dyu R575 R460 Discovery Miles 4 600
Elektra Health 8076 Electrode Hot Steam…
 (14)
R580 R474 Discovery Miles 4 740
Microsoft Xbox Series X Console (1TB…
R14,999 Discovery Miles 149 990
Jumbo Jan van Haasteren Comic Jigsaw…
 (1)
R439 R399 Discovery Miles 3 990

 

Partners