(1256) 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...

Full description

Bibliographic Details

Main Authors:	Bazaraa, Mokhtar S., Elshafei, Alwalid N.
Format:	Other
Language:	English
Published:	The Institute Of National Planning. 2018
Subjects:	Trees Methodology Procedure
Online Access:	http://repository.inp.edu.eg/handle/123456789/3984
Tags:	Add Tag No Tags, Be the first to tag this record!