Nonlinear Assignment Problems : Algorithms and Applications (Combinatorial Optimization, V. 7)

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.