An exact Branch-and-Bound procedure for the quadratic assignment problem

The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Bazaraa, Mokhtar S., Elshafei, Alwalid N.
Materyal Türü: Other
Dil:İngilizce
Baskı/Yayın Bilgisi: The Institute Of National Planning. 2018
Konular:
Online Erişim:http://repository.inp.edu.eg/xmlui/handle/123456789/3984
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller