BRANCH AND BOUND ALGORITHM FOR GENERALIZED ASSIGNMENT PROBLEM

被引：295
作者：
ROSS, GT
SOLAND, RM
机构：
[1] UNIV MASSACHUSETTS, AMHERST, MA 01002 USA
[2] UNIV TEXAS, AUSTIN, TX 78712 USA
来源：
MATHEMATICAL PROGRAMMING | 1975年 / 8卷 / 01期
关键词：
D O I：
10.1007/BF01580430
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：91 / 103
页数：13
相关论文
共 14 条
[1]  
BALACHANDRAN V, 1972, 34723 CARN MELL U GR
[2]  
CHARNES A, 1973, CS115 U TEX CTR CYB
[3]   A TREE-SEARCH ALGORITHM FOR MIXED INTEGER PROGRAMMING-PROBLEMS [J].
DAKIN, RJ .
COMPUTER JOURNAL, 1965, 8 (03) :250-253
[4]   ALL ZERO-ONE ALGORITHM FOR A CERTAIN CLASS OF TRANSPORTATION PROBLEMS [J].
DEMAIO, A ;
ROVEDA, C .
OPERATIONS RESEARCH, 1971, 19 (06) :1406-&
[5]   AN IMPROVED IMPLICIT ENUMERATION APPROACH FOR INTEGER PROGRAMMING [J].
GEOFFRIO.AM .
OPERATIONS RESEARCH, 1969, 17 (03) :437-&
[6]  
Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[7]   MULTICOMMODITY DISTRIBUTION SYSTEM-DESIGN BY BENDERS DECOMPOSITION [J].
GEOFFRION, AM ;
GRAVES, GW .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05) :822-844
[8]   BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].
GREENBERG, H ;
HEGERICH, RL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332
[9]  
GRIGORIADIS MD, 1974, 45TH JOINT NAT M OP
[10]  
GROSS D, 1972, 63095 GEORG WASH U I
12