Stock image for illustration purposes only - book cover, edition or condition may vary.
Nonlinear Assignment Problems
. Ed(S): Pardalos, Panos M.; Pitsoulis, Leonidas S.
€ 187.41
FREE Delivery in Ireland
Description for Nonlinear Assignment Problems
Hardback. Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem. This work provides major algorithmic aspects and applications of NAPs as contributed by international experts. Approximation algorithms and semi-definite programming approaches are included. Editor(s): Pardalos, Panos M.; Pitsoulis, Leonidas S. Series: Combinatorial Optimization. Num Pages: 328 pages, biography. BIC Classification: PBU; UNC; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 19. Weight in Grams: 642.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
Kluwer Academic Publishers United States
Number of pages
328
Condition
New
Series
Combinatorial Optimization
Number of Pages
304
Place of Publication
Dordrecht, Netherlands
ISBN
9780792366461
SKU
V9780792366461
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Nonlinear Assignment Problems