|
Volumn 8, Issue 3, 2011, Pages 411-416
|
The Wiener maximum quadratic assignment problem
|
Author keywords
Combinatorial optimization; Computational complexity; Degree sequence; Graph theory; Wiener index
|
Indexed keywords
CHEMICAL GRAPH THEORY;
DEGREE SEQUENCE;
DISTANCE MATRICES;
FOLLOWING PROBLEM;
MATRIX;
NP-HARD;
OPEN PROBLEMS;
POINT SET;
POLYNOMIAL-TIME;
PRESCRIBED DEGREE SEQUENCE;
QUADRATIC ASSIGNMENT PROBLEMS;
WIENER INDEX;
COMBINATORIAL OPTIMIZATION;
COMPUTATIONAL COMPLEXITY;
MOLECULAR STRUCTURE;
PLANT EXTRACTS;
POLYNOMIAL APPROXIMATION;
TREES (MATHEMATICS);
|
EID: 79960084559
PISSN: 15725286
EISSN: None
Source Type: Journal
DOI: 10.1016/j.disopt.2011.02.002 Document Type: Article |
Times cited : (46)
|
References (15)
|