A DUAL-ASCENT PROCEDURE FOR LARGE-SCALE UNCAPACITATED NETWORK DESIGN

被引：146
作者：
BALAKRISHNAN, A
MAGNANTI, TL
WONG, RT
机构：
[1] MIT,LEADERS MFG PROGRAM,CAMBRIDGE,MA 02139
[2] MIT,CTR OPERAT RES,CAMBRIDGE,MA 02139
[3] PURDUE UNIV,KRANNERT GRAD SCH MANAGEMENT,W LAFAYETTE,IN 47907
来源：
OPERATIONS RESEARCH | 1989年 / 37卷 / 05期
关键词：
D O I：
10.1287/opre.37.5.716
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：716 / 740
页数：25
相关论文
共 49 条
[1]   LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM [J].
BALAKRISHNAN, A .
MATHEMATICAL PROGRAMMING, 1987, 39 (03) :263-284
[2]  
BALAKRISHNAN A, 1984, THESIS MIT CAMBRIDGE
[3]  
BALAKRISHNAN A, 1985, ORSA TIMS JOINT NATI
[4]  
BARANY I, 1984, MATH PROGRAM STUD, V22, P32, DOI 10.1007/BFb0121006
[5]   STRONG FORMULATIONS FOR MULTI-ITEM CAPACITATED LOT SIZING [J].
BARANY, I ;
VANROY, TJ ;
WOLSEY, LA .
MANAGEMENT SCIENCE, 1984, 30 (10) :1255-1261
[6]  
BEALE EML, 1972, MATHEMATICAL PROGRAM, V3, P339
[7]  
Bilde O., 1977, ANN DISCRETE MATH, V1, P79
[8]  
Billheimer J. W., 1973, Transportation Science, V7, P49, DOI 10.1287/trsc.7.1.49
[9]   SOLVING THE OPTIMAL NETWORK PROBLEM [J].
BOFFEY, TB ;
HINXMAN, AI .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (05) :386-393
[10]   OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM [J].
BOYCE, DE ;
FARHI, A ;
WEISCHEDEL, R .
ENVIRONMENT AND PLANNING A, 1973, 5 (04) :519-533
12345