A proximal DC algorithm on a rank-constrained DNN reformulation solves most QAPLIB instances to optimality and gives bounds within a few percent on the rest.
SIAM Journal on Optimiza- tion 17, 1205-1223 (2007)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A proximal DC approach for quadratic assignment problem
A proximal DC algorithm on a rank-constrained DNN reformulation solves most QAPLIB instances to optimality and gives bounds within a few percent on the rest.