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 (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,525 Discovery Miles 45 250 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 (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,529 Discovery Miles 45 290 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...
Rhodes And His Banker - Empire, Wealth…
Richard Steyn Paperback R330 R220 Discovery Miles 2 200
Bug-A-Salt 3.0 Black Fly
 (1)
R999 Discovery Miles 9 990
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Aerolatte Cappuccino Art Stencils (Set…
R110 R95 Discovery Miles 950
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Snappy Tritan Bottle (1.2L)(Coral)
R209 R169 Discovery Miles 1 690
Dromex 3-Ply Medical Mask (Box of 50)
 (17)
R1,099 R399 Discovery Miles 3 990
American Gods - Season 2
Ricky Whittle, Ian McShane DVD  (1)
R55 Discovery Miles 550
Croxley CREATE Fibre Tip Khokis (12…
R43 Discovery Miles 430
Kenwood Dry Bagless Vacuum Cleaner…
R1,389 R1,129 Discovery Miles 11 290

 

Partners