Abstract: A nonconvex-concave minimax quadratic problem is studied in this paper. An efficient alternating algorithm is proposed without any convexification procedures and constraint relaxations. By ...
Abstract: This article considers modern applied problems formalized as the Quadratic Assignment Problem (QAP) and its generalizations. The main mathematical formulations are analyzed, with particular ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results