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

Whakaahuatanga katoa

Ngā taipitopito rārangi puna kōrero

Ngā kaituhi matua:	Bazaraa, Mokhtar S., Elshafei, Alwalid N.
Hōputu:	Other
Reo:	Ingarihi
I whakaputaina:	The Institute Of National Planning. 2018
Ngā marau:	Trees Methodology Procedure
Urunga tuihono:	http://repository.inp.edu.eg/xmlui/handle/123456789/3984
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!