On the Maximum Quadratic Assignment Problem

Quadratic assignment is a basic problem in combinatorial optimization that generalizes several other problems such as traveling salesman, linear arrangement, dense k subgraph, and clustering with given sizes. The input to the quadratic assignment problem consists of two n x n symmetric nonnegative m...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics of operations research Vol. 34; no. 4; pp. 859 - 868
Main Authors:	Nagarajan, Viswanath, Sviridenko, Maxim
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 01.11.2009 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Analysis Approximation Approximation algorithms Approximation theory Approximations Branch & bound algorithms Combinatorial optimization Integrality Linear programming linear programming relaxation Mathematical permutation Mathematics Maximum value Objective functions Quadratic programming Studies Triangle inequalities Vertices United States
ISSN:	0364-765X, 1526-5471
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!