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...
Tough Enough - Hone Your Habits…
Trey Tucker Paperback R350 R270 Discovery Miles 2 700
Ramsey Theory - Yesterday, Today, and…
Alexander Soifer Hardcover R2,757 Discovery Miles 27 570
Agile Project Management - How to Make…
James Edge Hardcover R655 R584 Discovery Miles 5 840
Song For Sarah - Lessons From My Mother
Jonathan Jansen, Naomi Jansen Hardcover  (3)
R100 R93 Discovery Miles 930
Fuzzy Graphs and Fuzzy Hypergraphs
John N. Mordeson, Premchand S. Nair Hardcover R4,040 Discovery Miles 40 400
Brother HL-L8360CDW Colour Laser Printer…
R8,826 Discovery Miles 88 260
The Marriage Book
Nicky Lee, Sila Lee Paperback R305 R272 Discovery Miles 2 720
Canon 445XL and 446XL Original High…
R1,700 R890 Discovery Miles 8 900
365 Reasons Why You're The Perfect Mom
Hardcover R240 R199 Discovery Miles 1 990
Matroid Theory
James Oxley Hardcover R6,063 Discovery Miles 60 630

 

Partners