A NEW LAGRANGIAN-RELAXATION APPROACH TO THE GENERALIZED ASSIGNMENT PROBLEM

被引:63
作者
JORNSTEN, K
NASBERG, M
机构
关键词
D O I
10.1016/0377-2217(86)90328-0
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:313 / 323
页数:11
相关论文
共 24 条
[1]  
CHALMET L, 1976, 2ND P EUR C OP RES N, P103
[2]  
DUDZINSKI K, 1983, ALGORITHM LINEAR MUL
[3]   AN O(N) ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK LINEAR PROGRAM [J].
DYER, ME .
MATHEMATICAL PROGRAMMING, 1984, 29 (01) :57-63
[5]   A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING [J].
FISHER, ML ;
JAIKUMAR, R .
NETWORKS, 1981, 11 (02) :109-124
[6]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[7]  
FISHER ML, 1981, MULTIPLIER ADJUSTMEN
[8]  
Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[9]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[10]  
Johnson E. L., 1981, Operations Research Letters, V1, P18, DOI 10.1016/0167-6377(81)90019-5