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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematics of operations research Jg. 34; H. 4; S. 859 - 868
Hauptverfasser:	Nagarajan, Viswanath, Sviridenko, Maxim
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum INFORMS 01.11.2009 Institute for Operations Research and the Management Sciences
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!