Nonlinear Assignment Problems : Algorithms and Applications /
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 pr...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Boston, MA :
Springer US,
2000.
|
| Series: | Combinatorial optimization ;
7. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Search Result 1
