Compressing branch-and-bound trees

被引：0

作者：

Munoz, Gonzalo ^{[1
]}

Paat, Joseph ^{[2
]}

Xavier, Alinson S. ^{[3
]}

机构：

[1] Univ OHiggins, Inst Engn Sci, Rancagua, Chile

[2] Univ British Columbia, Sauder Sch Business, Vancouver, BC, Canada

[3] Energy Syst & Infrastruct Anal Div, Argonne Natl Lab, Lemont, IL USA

来源：

MATHEMATICAL PROGRAMMING | 2024年 / 210卷 / 1期

关键词：

90C10; 90C57; INTEGER; DISJUNCTIONS;

D O I：

10.1007/s10107-024-02080-5

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB treeTthat certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node inTor (2) removing leaves fromT? We believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.

引用

页码：669 / 694

页数：26

共 50 条

[31] ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS
LAI, TH
SAHNI, S
COMMUNICATIONS OF THE ACM, 1984, 27 (06) : 594 - 602
[32] COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1977, 20 (01) : 16 - 35
[33] EXPECTED PERFORMANCE OF BRANCH-AND-BOUND ALGORITHMS
LENSTRA, JK
RINNOOYKAN, AHG
OPERATIONS RESEARCH, 1978, 26 (02) : 347 - 349
[34] SURROGATE DUALITY IN A BRANCH-AND-BOUND PROCEDURE
KARWAN, MH
RARDIN, RL
NAVAL RESEARCH LOGISTICS, 1981, 28 (01) : 93 - 101
[35] A RANDOMIZED PARALLEL BRANCH-AND-BOUND ALGORITHM
JANAKIRAM, VK
GEHRINGER, EF
AGRAWAL, DP
MEHROTRA, R
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1988, 17 (03) : 277 - 301
[36] A Branch-and-Bound Approach for Tautomer Enumeration
Thalheim, Torsten
Wagner, Barbara
Kuehne, Ralph
Middendorf, Martin
Schueuermann, Gerrit
MOLECULAR INFORMATICS, 2015, 34 (05) : 263 - 275
[37] PERFORMANCE OF PARALLEL BRANCH-AND-BOUND ALGORITHMS
LAI, TH
SPRAGUE, A
IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) : 962 - 964
[38] Basis Reduction and the Complexity of Branch-and-Bound
Pataki, Gabor
Tural, Mustafa
Wong, Erick B.
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1254 - +
[39] A BRANCH-AND-BOUND ALGORITHM FOR UNIT COMMITMENT
COHEN, AI
YOSHIMURA, M
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1983, 102 (02): : 444 - 451
[40] Performance analysis of branch-and-bound skeletons
Dorta, I
León, C
Rodríguez, C
PROCEEDINGS OF THE 14TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING, 2005, : 75 - 82

← 1 2 3 4 5 →