|
Volumn 22, Issue 4, 2011, Pages 845-856
|
Polynomially solvable special cases of the quadratic bottleneck assignment problem
|
Author keywords
Bottleneck Monge matrix; Max cone; Quadratic bottleneck assignment problem
|
Indexed keywords
ASSIGNMENT PROBLEMS;
BOTTLENECK ASSIGNMENT PROBLEM;
COST MATRICES;
MAX-CONE;
MONGE MATRICES;
NP-HARD PROBLEM;
OBJECTIVE FUNCTIONS;
OPTIMALITY;
POLYNOMIAL ALGORITHM;
POLYNOMIAL-TIME;
POLYNOMIALLY SOLVABLE SPECIAL CASE;
COMPUTATIONAL COMPLEXITY;
OPTIMIZATION;
POLYNOMIAL APPROXIMATION;
PROBLEM SOLVING;
|
EID: 83555173678
PISSN: 13826905
EISSN: 15732886
Source Type: Journal
DOI: 10.1007/s10878-010-9333-7 Document Type: Article |
Times cited : (6)
|
References (9)
|