ALGORITHMS FOR SIMPLE PLANT-LOCATION PROBLEM WITH SOME SIDE CONDITIONS

被引：82
作者：
SPIELBERG, K
机构：
来源：
OPERATIONS RESEARCH | 1969年 / 17卷 / 01期
关键词：
D O I：
10.1287/opre.17.1.85
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：85 / +
页数：1
相关论文
共 8 条
[1]   AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].
BALAS, E .
OPERATIONS RESEARCH, 1965, 13 (04) :517-&
[2]  
BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [DOI 10.1007/S10287-004-0020-Y, 10.1007/BF01386316, DOI 10.1007/BF01386316]
[3]   A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION [J].
EFROYMSON, MA ;
RAY, TL .
OPERATIONS RESEARCH, 1966, 14 (03) :361-+
[4]  
Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670
[5]   A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].
GLOVER, F .
OPERATIONS RESEARCH, 1965, 13 (06) :879-&
[6]   AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].
LAND, AH ;
DOIG, AG .
ECONOMETRICA, 1960, 28 (03) :497-520
[7]   DIRECT SEARCH ALGORITHMS FOR ZERO-1 AND MIXED-INTEGER PROGRAMMING [J].
LEMKE, CE ;
SPIELBER.K .
OPERATIONS RESEARCH, 1967, 15 (05) :892-+
[8]  
SPIELBERG K, 1964, 19 P NATL C ACM
1