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

Ante Custic Abraham P. Punnen

Published in: CoRR (2015)

Keyphrases

quadratic assignment problem
pairwise
randomly generated
training instances
machine learning
artificial intelligence
computational complexity
database
objective function
optimal solution
constraint satisfaction problems
lower and upper bounds
stochastic local search