Two classes of quadratic assignment problems that are solvable as linear assignment problems

Name: Two classes of quadratic assignment problems that are solvable as linear assignment problems
Author: Erdoğan, Güneş, Tansel, B. Ç.

İsim	Two classes of quadratic assignment problems that are solvable as linear assignment problems
Yazar	Erdoğan, Güneş, Tansel, B. Ç.
Basım Tarihi:	2011-08
Basım Yeri	- Elsevier
Konu	Quadratic Assignment Problem, Linear Assignment Problem, Computational complexity, Polynomial time solvability
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1572-5286
Kayıt Numarası	308a3b2f-df8b-4d20-a081-1a624c799891
Lokasyon	Industrial Engineering
Tarih	2011-08
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes.
DOI	10.1016/j.disopt.2011.03.002
Cilt	8

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Two classes of quadratic assignment problems that are solvable as linear assignment problems

Yazar Erdoğan, Güneş, Tansel, B. Ç.

Basım Tarihi 2011-08

Basım Yeri - Elsevier

Konu Quadratic Assignment Problem, Linear Assignment Problem, Computational complexity, Polynomial time solvability

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1572-5286

Kayıt Numarası 308a3b2f-df8b-4d20-a081-1a624c799891

Lokasyon Industrial Engineering

Tarih 2011-08

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes.

DOI 10.1016/j.disopt.2011.03.002

Cilt 8