A characterization of linearizable instances of the quadratic minimum spanning tree problem.

Ante Custic Abraham P. Punnen

Published in: J. Comb. Optim. (2018)

Keyphrases

quadratic assignment problem
objective function
computational complexity
randomly generated
pairwise
real time
expert systems
test instances
learning algorithm
search algorithm
lower bound
instance selection
training instances