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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematics of operations research Ročník 34; číslo 4; s. 859 - 868
Hlavní autoři:	Nagarajan, Viswanath, Sviridenko, Maxim
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Linthicum INFORMS 01.11.2009 Institute for Operations Research and the Management Sciences
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!