
Tell your friends about this item:
Nonlinear Assignment Problems: Algorithms and Applications - Combinatorial Optimization 2001 edition
P M Pardalos
Nonlinear Assignment Problems: Algorithms and Applications - Combinatorial Optimization 2001 edition
P M Pardalos
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.
328 pages, biography
Media | Books Hardcover Book (Book with hard spine and cover) |
Released | November 30, 2000 |
ISBN13 | 9780792366461 |
Publishers | Springer |
Pages | 304 |
Dimensions | 155 × 235 × 19 mm · 648 g |
Language | English |
Editor | Pardalos, Panos M. |
Editor | Pitsoulis, L.S. |