Showing 1 - 2 of 2
Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408–3426, <CitationRef CitationID="CR25">2010</CitationRef>; Peng et...</citationref>
Persistent link: https://www.econbiz.de/10011151824
Persistent link: https://www.econbiz.de/10008552380