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 House In The Pines
Ana Reyes Paperback R439 R401 Discovery Miles 4 010
Database Recovery
Vijay Kumar, Sang Hyuk Son Hardcover R4,065 Discovery Miles 40 650
NOSH Gluten-Free - A No-Fuss, Everyday…
Joy May Paperback  (1)
R316 Discovery Miles 3 160
The Politics of Privacy - Planning for…
James B. Rule, Etc Hardcover R1,794 Discovery Miles 17 940
Mechanical and Quartz Watch Repair
Mick Watters Hardcover R667 Discovery Miles 6 670
A History of Holistic Literacy - Five…
M.P. Cavanaugh Hardcover R2,035 Discovery Miles 20 350
Top Gun: Maverick
Tom Cruise, Miles Teller, … DVD  (1)
R234 Discovery Miles 2 340
Philosophy for Children - Theories and…
Babs Anderson Paperback R1,288 Discovery Miles 12 880
Zeros And Ones
Ethan Hawke, Cristina Chiriac DVD R184 Discovery Miles 1 840
Maped Advanced Office Scissors (21cm)
 (2)
R96 Discovery Miles 960

 

Partners