Author:
Gass Saul I.,Harris Carl M.
Reference122 articles.
1. Bazaraa, M.S. and O. Kirca (1983). “A Branch- and-Bound-Based Heuristic for Solving the Quadratic Assignment Problem,” Naval Research Logistics Quarterly, 30, 287–304
2. Bazaraa, M.S. and H.D. Sherali (1980). “Bender’s Partitioning Scheme Applied to a New Formulation of the Quadratic Assignment Problem,” Naval Research Logistics Quarterly, 27, 29–41
3. Bozer, Y.A., R.D. Melier, and S.J. Erlebacher (1994). “An Improvement-type Layout Algorithm for Single and Multiple-floor Facilities,” Management Science, 40, 918–932
4. Burkard, R.E. and T. Bonniger (1983). “A Heuris-tic for Quadratic Boolean Programs with Applications to Quadratic Assignment Problems,” European Jl. Operational Research, 13, 374–386
5. Burkard, R.E. and U. Derigs (1980). Assignment and Matching Problems: Solution Methods with Fortran Programs. Vol. 184 of Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin