PIVOT AND COMPLEMENT - A HEURISTIC FOR 0-1 PROGRAMMING

被引:139
作者
BALAS, E [1 ]
MARTIN, CH [1 ]
机构
[1] OHIO STATE UNIV,DEPT IND & SYST ENGN,COLUMBUS,OH 43210
关键词
D O I
10.1287/mnsc.26.1.86
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:86 / 96
页数:11
相关论文
共 24 条
[1]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2]  
BALAS E, 1979, MSRR414 CARN MELL U
[3]  
BOUVIER B, 1965, PROGRAMMES LINEAIRES
[4]   INTERIOR PATH METHODS FOR HEURISTIC INTEGER PROGRAMMING PROCEDURES [J].
FAALAND, BH ;
HILLIER, FS .
OPERATIONS RESEARCH, 1979, 27 (06) :1069-1087
[5]  
GAREY MR, 1976, ALGORITHMS COMPLEXIT
[6]   NEW APPROACH TO DISCRETE MATHEMATICAL PROGRAMMING [J].
GRAVES, G ;
WHINSTON, A .
MANAGEMENT SCIENCE, 1968, 15 (03) :177-190
[7]   EFFICIENT HEURISTIC PROCEDURES FOR INTEGER LINEAR PROGRAMMING WITH AN INTERIOR [J].
HILLIER, FS .
OPERATIONS RESEARCH, 1969, 17 (04) :600-&
[8]  
IBARAKI T, 1974, MATH PROGRAMMING STU, V2, P115
[9]   EXPERIMENTAL RESULTS ON HILLIERS LINEAR SEARCH [J].
JEROSLOW, RG ;
SMITH, THC .
MATHEMATICAL PROGRAMMING, 1975, 9 (03) :371-376
[10]  
Karp Richard M., 1972, COMPLEXITY COMPUTER, P85