ON THE CONVERGENCE OF 2 BRANCH-AND-BOUND ALGORITHMS FOR NONCONVEX PROGRAMMING-PROBLEMS

被引:22
作者
BENSON, HP
机构
关键词
D O I
10.1007/BF00934342
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:129 / 134
页数:6
相关论文
共 50 条
[41]   BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC-PROGRAMMING [J].
MORIN, TL ;
MARSTEN, RE .
OPERATIONS RESEARCH, 1976, 24 (04) :611-627
[42]   Stochastic Constraint Programming with And-Or Branch-and-Bound [J].
Babaki, Behrouz ;
Guns, Tias ;
de Raedt, Luc .
PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, :539-545
[43]   AN EXERCISE IN TRANSFORMATIONAL PROGRAMMING - BACKTRACKING AND BRANCH-AND-BOUND [J].
FOKKINGA, MM .
SCIENCE OF COMPUTER PROGRAMMING, 1991, 16 (01) :19-48
[44]   An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems [J].
Gao, Yuelin ;
Zhang, Nihong ;
Ma, Xiaohua .
ADVANCES IN GLOBAL OPTIMIZATION, 2015, 95 :40-49
[45]   AND/OR Branch-and-Bound search for pure 0/1 integer linear programming problems [J].
Marinescu, Radu ;
Dechter, Rina .
INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2006, 3990 :152-166
[46]   BRANCH-AND-BOUND ALGORITHM FOR ZERO-ONE MIXED INTEGER PROGRAMMING PROBLEMS [J].
DAVIS, RE ;
KENDRICK, DA ;
WEITZMAN, M .
OPERATIONS RESEARCH, 1971, 19 (04) :1036-&
[47]   POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS [J].
IBARAKI, T .
JOURNAL OF THE ACM, 1977, 24 (02) :264-279
[48]   COPING WITH ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS [J].
LI, GJ ;
WAH, BW .
IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (06) :568-573
[49]   Probabilistic subproblem selection in branch-and-bound algorithms [J].
Dür, M ;
Stix, V .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2005, 182 (01) :67-80
[50]   Branch-and-bound algorithms for the test cover problem [J].
De Bontridder, KMJ ;
Lageweg, BJ ;
Lenstra, JK ;
Orlin, JB ;
Stougie, L .
ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 :223-233