TREE-SEARCH ALGORITHMS FOR QUADRATIC ASSIGNMENT PROBLEMS

被引:54
作者
PIERCE, JF
CROWSTON, WB
机构
来源
NAVAL RESEARCH LOGISTICS QUARTERLY | 1971年 / 18卷 / 01期
关键词
D O I
10.1002/nav.3800180102
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
引用
收藏
页码:1 / &
相关论文
共 33 条
[1]   A HEURISTIC ALGORITHM AND SIMULATION APPROACH TO RELATIVE LOCATION OF FACILITIES [J].
ARMOUR, GC ;
BUFFA, ES .
MANAGEMENT SCIENCE, 1963, 9 (02) :294-309
[2]   FORMULATION OF SOME ALLOCATION AND CONNECTION PROBLEMS AS INTEGER PROGRAMS [J].
BREUER, MA .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1966, 13 (01) :83-&
[3]  
CONWAY RW, 1961, J IND ENG, V12, P34
[4]  
EASTMAN WL, 1958, B1 HARV U COMP LAB R, V20
[5]   THE TRAVELING-SALESMAN PROBLEM [J].
FLOOD, MM .
OPERATIONS RESEARCH, 1956, 4 (01) :61-75
[6]  
Ford Lester R., 1962, FLOWS NETWORKS
[7]  
GASCHUTZ GK, 1968, NAV RES LOGIST Q, V15, P49
[8]   OPTIMAL ASSIGNMENT OF FACILITIES TO LOCATIONS BY BRANCH AND BOUND [J].
GAVETT, JW ;
PLYTER, NV .
OPERATIONS RESEARCH, 1966, 14 (02) :210-&
[9]   INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS METHOD [J].
GEOFFRION, AM .
SIAM REVIEW, 1967, 9 (02) :178-+
[10]   OPTIMAL AND SUBOPTIMAL ALGORITHMS FOR THE QUADRATIC ASSIGNMENT PROBLEM [J].
GILMORE, PC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (02) :305-313