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...
Holy Fvck
Demi Lovato CD R414 Discovery Miles 4 140
Philips TAUE101 Wired In-Ear Headphones…
R199 R129 Discovery Miles 1 290
Broken To Heal - Deceit, Destruction…
Alistair Izobell Paperback R200 Discovery Miles 2 000
Higher
Michael Buble CD  (1)
R459 Discovery Miles 4 590
Multi Colour Animal Print Neckerchief
R119 Discovery Miles 1 190
Docking Edition Multi-Functional…
R899 R399 Discovery Miles 3 990
Bostik Art & Craft White Glue (100ml)
R51 R33 Discovery Miles 330
Bestway Sidewinder AC Air Pump
R275 Discovery Miles 2 750
Sony NEW Playstation Dualshock 4 v2…
 (22)
R1,428 Discovery Miles 14 280
We Were Perfect Parents Until We Had…
Vanessa Raphaely, Karin Schimke Paperback R330 R220 Discovery Miles 2 200

 

Partners