COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS

被引:10
作者
IBARAKI, T [1 ]
机构
[1] KYOTO UNIV,FAC ENGN,DEPT APPL MATH & PHYS,KYOTO 606,JAPAN
关键词
D O I
10.15807/jorsj.20.16
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:16 / 35
页数:20
相关论文
共 28 条
[21]   BRANCH-AND-BOUND METHODS - A SURVEY [J].
LAWLER, EL ;
WOOD, DE .
OPERATIONS RESEARCH, 1966, 14 (04) :699-+
[22]  
LENSTRA JK, TO BE PUBLISHED
[23]   BRANCH-AND-BOUND METHODS - GENERAL FORMULATION AND PROPERTIES [J].
MITTEN, LG .
OPERATIONS RESEARCH, 1970, 18 (01) :24-&
[24]   BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC-PROGRAMMING [J].
MORIN, TL ;
MARSTEN, RE .
OPERATIONS RESEARCH, 1976, 24 (04) :611-627
[25]  
Nilsson N.J., 1971, PROBLEM SOLVING METH
[26]  
POHL I, 1969, MACHINE INTELLIGENCE, P5
[27]   ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS [J].
SAHNI, SK .
JOURNAL OF THE ACM, 1976, 23 (01) :116-127
[28]  
[No title captured]