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...
The Nature of Mathematics and the…
S. Andersson, M. Jacob Hardcover R7,396 Discovery Miles 73 960
Handbook of Robotic and Image-Guided…
Mohammad Hossein Abedin Nasab Hardcover R6,012 Discovery Miles 60 120
Collected Writings of W.D. Gann - Volume…
William D. Gann Hardcover R4,672 Discovery Miles 46 720
Intelligent Help Systems for UNIX
Stephen J. Hegner, Paul Mc Kevitt, … Hardcover R2,270 Discovery Miles 22 700
Innovation Together - Microsoft Research…
Lolan Song Hardcover R2,667 Discovery Miles 26 670
Rexel WireBind 34 Loop Binders (6mm)(No…
R515 R424 Discovery Miles 4 240
The Netanyahus
Joshua Cohen Paperback R256 R232 Discovery Miles 2 320
SDS Binding Elements (10mm)(100…
R120 Discovery Miles 1 200
The Lost Boys
Faye Kellerman Paperback R330 R227 Discovery Miles 2 270
Bafana Republic And Other Satires - A…
Mike Van Graan Paperback R250 R231 Discovery Miles 2 310

 

Partners