Numerical experience with lower bounds for MIQP branch-and-bound

被引：114

作者：

Fletcher, R ^{[1
]}

Leyffer, S ^{[1
]}

机构：

[1] Univ Dundee, Dept Math, Dundee DD1 4HN, Scotland

来源：

SIAM JOURNAL ON OPTIMIZATION | 1998年 / 8卷 / 02期

关键词：

integer programming; mixed integer quadratic programming; branch-and-bound;

D O I：

10.1137/S1052623494268455

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The solution of convex mixed-integer quadratic programming (MIQP) problems with a general branch-and-bound framework is considered. It is shown how lower bounds can be computed efficiently during the branch-and-bound process. Improved lower bounds such as the ones derived in this paper can reduce the number of quadratic programming (QP) problems that have to be solved. The branch-and-bound approach is also shown to be superior to other approaches in solving MIQP problems. Numerical experience is presented which supports these conclusions.

引用

页码：604 / 616

页数：13

共 50 条

[21] A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem
Fujita, S
Masukawa, M
Tagashira, S
NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 611 - 616
[22] Branch-and-bound algorithms on a hypercube
Pargas, R.P.
Wooster, D.E.
Conference on Hypercube Concurrent Computers and Applications, 1988,
[23] AND/OR Branch-and-Bound for Graphical Models
Marinescu, Radu
Dechter, Rina
19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 224 - 229
[24] BRANCH-AND-BOUND PROGRAM GENERATOR
NOLTEMEIER, H
COMPUTING, 1971, 8 (1-2) : 99 - +
[25] PROBLEMS UNSOLVABLE BY BRANCH-AND-BOUND
JEROSLOW, RG
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (04): : A440 - A441
[26] Compressing Branch-and-Bound Trees
Munoz, Gonzalo
Paat, Joseph
Xavier, Alinson S.
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2023, 2023, 13904 : 348 - 362
[27] A NOTE ON BRANCH-AND-BOUND PRINCIPLE
BALAS, E
OPERATIONS RESEARCH, 1968, 16 (02) : 442 - &
[28] BRANCH-AND-BOUND METHODS - A SURVEY
LAWLER, EL
WOOD, DE
OPERATIONS RESEARCH, 1966, 14 (04) : 699 - +
[29] Compressing branch-and-bound trees
Munoz, Gonzalo
Paat, Joseph
Xavier, Alinson S.
MATHEMATICAL PROGRAMMING, 2024, 210 (1) : 669 - 694
[30] AND/OR Branch-and-Bound on a Computational Grid
Otten, Lars
Dechter, Rina
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 351 - 435

← 1 2 3 4 5 →