首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
SURROGATE DUALITY IN A BRANCH-AND-BOUND PROCEDURE
被引:10
|
作者
:
KARWAN, MH
论文数:
0
引用数:
0
h-index:
0
机构:
GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
KARWAN, MH
[
1
]
RARDIN, RL
论文数:
0
引用数:
0
h-index:
0
机构:
GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
RARDIN, RL
[
1
]
机构
:
[1]
GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
来源
:
NAVAL RESEARCH LOGISTICS
|
1981年
/ 28卷
/ 01期
关键词
:
D O I
:
10.1002/nav.3800280107
中图分类号
:
C93 [管理学];
O22 [运筹学];
学科分类号
:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要
:
引用
收藏
页码:93 / 101
页数:9
相关论文
共 50 条
[1]
SURROGATE DUALITY IN A BRANCH-AND-BOUND PROCEDURE FOR INTEGER PROGRAMMING
SARIN, S
论文数:
0
引用数:
0
h-index:
0
机构:
SUNY BUFFALO, BUFFALO, NY 14260 USA
SARIN, S
KARWAN, MH
论文数:
0
引用数:
0
h-index:
0
机构:
SUNY BUFFALO, BUFFALO, NY 14260 USA
KARWAN, MH
RARDIN, RL
论文数:
0
引用数:
0
h-index:
0
机构:
SUNY BUFFALO, BUFFALO, NY 14260 USA
RARDIN, RL
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,
1988,
33
(03)
: 326
-
333
[2]
A BRANCH-AND-BOUND PROCEDURE FOR ROBOT ASSEMBLY PLANNING
LEE, J
论文数:
0
引用数:
0
h-index:
0
机构:
BEN GURION UNIV NEGEV,IND & MANAGEMENT ENGN,IL-94105 BEER SHEVA,ISRAEL
BEN GURION UNIV NEGEV,IND & MANAGEMENT ENGN,IL-94105 BEER SHEVA,ISRAEL
LEE, J
RAZ, T
论文数:
0
引用数:
0
h-index:
0
机构:
BEN GURION UNIV NEGEV,IND & MANAGEMENT ENGN,IL-94105 BEER SHEVA,ISRAEL
BEN GURION UNIV NEGEV,IND & MANAGEMENT ENGN,IL-94105 BEER SHEVA,ISRAEL
RAZ, T
COMPUTERS & INDUSTRIAL ENGINEERING,
1990,
18
(03)
: 407
-
423
[3]
A BRANCH-AND-BOUND PROCEDURE FOR ROBOT ASSEMBLY PLANNING
LEE, J
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV IOWA,IND & MANAGEMENT ENGN,IOWA CITY,IA 52242
UNIV IOWA,IND & MANAGEMENT ENGN,IOWA CITY,IA 52242
LEE, J
RAZ, T
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV IOWA,IND & MANAGEMENT ENGN,IOWA CITY,IA 52242
UNIV IOWA,IND & MANAGEMENT ENGN,IOWA CITY,IA 52242
RAZ, T
COMPUTERS & INDUSTRIAL ENGINEERING,
1989,
17
: 215
-
220
[4]
Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
Phan, Dzung T.
论文数:
0
引用数:
0
h-index:
0
机构:
IBM Corp, Thomas J Watson Res Ctr, Dept Business Analyt & Math Sci, Yorktown Hts, NY 10598 USA
IBM Corp, Thomas J Watson Res Ctr, Dept Business Analyt & Math Sci, Yorktown Hts, NY 10598 USA
Phan, Dzung T.
OPERATIONS RESEARCH,
2012,
60
(02)
: 275
-
285
[5]
A NEW NODE SELECTION STRATEGY IN THE BRANCH-AND-BOUND PROCEDURE
LIAO, CJ
论文数:
0
引用数:
0
h-index:
0
机构:
Department of Industrial Management, National Taiwan Institute of Technology, Taipei, 106, 43 Keelung Road
LIAO, CJ
COMPUTERS & OPERATIONS RESEARCH,
1994,
21
(10)
: 1095
-
1101
[6]
A BRANCH-AND-BOUND PROCEDURE TO SOLVE A BICRITERION SCHEDULING PROBLEM
SEN, T
论文数:
0
引用数:
0
h-index:
0
SEN, T
GUPTA, SK
论文数:
0
引用数:
0
h-index:
0
GUPTA, SK
IIE TRANSACTIONS,
1983,
15
(01)
: 84
-
88
[7]
EXACT BRANCH-AND-BOUND PROCEDURE FOR THE QUADRATIC-ASSIGNMENT PROBLEM
BAZARAA, MS
论文数:
0
引用数:
0
h-index:
0
机构:
INST NATL PLANNING,CAIRO,EGYPT
INST NATL PLANNING,CAIRO,EGYPT
BAZARAA, MS
ELSHAFEI, AN
论文数:
0
引用数:
0
h-index:
0
机构:
INST NATL PLANNING,CAIRO,EGYPT
INST NATL PLANNING,CAIRO,EGYPT
ELSHAFEI, AN
NAVAL RESEARCH LOGISTICS,
1979,
26
(01)
: 109
-
121
[8]
A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem
Hamaz, Idir
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Toulouse, CNRS, LAAS, UPS, Toulouse, France
Univ Toulouse, CNRS, LAAS, UPS, Toulouse, France
Hamaz, Idir
Houssin, Laurent
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Toulouse, CNRS, LAAS, UPS, Toulouse, France
Univ Toulouse, CNRS, LAAS, UPS, Toulouse, France
Houssin, Laurent
Cafieri, Sonia
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Toulouse, ENAC, F-31055 Toulouse, France
Univ Toulouse, CNRS, LAAS, UPS, Toulouse, France
Cafieri, Sonia
COMBINATORIAL OPTIMIZATION, ISCO 2018,
2018,
10856
: 228
-
240
[9]
A dynamic subgradient-based branch-and-bound procedure for set covering
Balas, E
论文数:
0
引用数:
0
h-index:
0
机构:
QUEUES ENFORTH DEV INC,SOFTWARE DEV PROJECTS,CAMBRIDGE,MA
QUEUES ENFORTH DEV INC,SOFTWARE DEV PROJECTS,CAMBRIDGE,MA
Balas, E
Carrera, MC
论文数:
0
引用数:
0
h-index:
0
机构:
QUEUES ENFORTH DEV INC,SOFTWARE DEV PROJECTS,CAMBRIDGE,MA
QUEUES ENFORTH DEV INC,SOFTWARE DEV PROJECTS,CAMBRIDGE,MA
Carrera, MC
OPERATIONS RESEARCH,
1996,
44
(06)
: 875
-
890
[10]
A method to improve integer linear programming problem with branch-and-bound procedure
Chan, Din-Yuen
论文数:
0
引用数:
0
h-index:
0
机构:
Natl Chung Cheng Univ, Dept Informat Management, Chiayi 62117, Taiwan
Chan, Din-Yuen
Ku, Cheng-Yuan
论文数:
0
引用数:
0
h-index:
0
机构:
Natl Chung Cheng Univ, Dept Informat Management, Chiayi 62117, Taiwan
Ku, Cheng-Yuan
Li, Ming-Chai
论文数:
0
引用数:
0
h-index:
0
机构:
Natl Chung Cheng Univ, Dept Informat Management, Chiayi 62117, Taiwan
Li, Ming-Chai
APPLIED MATHEMATICS AND COMPUTATION,
2006,
179
(02)
: 484
-
493
←
1
2
3
4
5
→