LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM

被引:9
作者
BALAKRISHNAN, A
机构
关键词
D O I
10.1007/BF02592077
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:263 / 284
页数:22
相关论文
共 21 条
[1]  
BALAKRISHNAN A, 1984, THESIS MIT CAMBRIDGE
[2]  
BALAKRISHNAN A, 1985, 877 PURD U KRANN GRA
[3]   ON THE UNCAPACITATED PLANT LOCATION PROBLEM .1. VALID INEQUALITIES AND FACETS [J].
CHO, DC ;
JOHNSON, EL ;
PADBERG, M ;
RAO, MR .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (04) :579-589
[4]   ON THE UNCAPACITATED PLANT LOCATION PROBLEM .2. FACETS AND LIFTING THEOREMS [J].
CHO, DC ;
PADBERG, MW ;
RAO, MR .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (04) :590-612
[5]  
Chvatal V., 1973, Discrete Mathematics, V4, P305, DOI 10.1016/0012-365X(73)90167-2
[6]   SOME FACETS OF THE SIMPLE PLANT LOCATION POLYTOPE [J].
CORNUEJOLS, G ;
THIZY, JM .
MATHEMATICAL PROGRAMMING, 1982, 23 (01) :50-74
[7]  
Cornuejols G., 1977, ANN DISCRETE MATH, V1, P163, DOI DOI 10.1016/S0167-5060(08)70732-5
[8]   SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].
CROWDER, H ;
JOHNSON, EL ;
PADBERG, M .
OPERATIONS RESEARCH, 1983, 31 (05) :803-834
[9]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009
[10]  
Grotschel M., 1981, Operations Research Letters, V1, P23, DOI 10.1016/0167-6377(81)90020-1