Compressing branch-and-bound trees

Muñoz, Gonzalo; Paat, Joseph; Xavier, Álinson S.

doi:10.1007/s10107-024-02080-5

Compressing branch-and-bound trees

Journal Article · Sat Apr 06 00:00:00 EDT 2024 · Mathematical Programming

DOI:https://doi.org/10.1007/s10107-024-02080-5· OSTI ID:2500845

Muñoz, Gonzalo ^[1]; ^[2]; Xavier, Álinson S. ^[3]

Universidad de O’Higgins, Rancagua (Chile)
Univ. of British Columbia, Vancouver, BC (Canada)
Argonne National Laboratory (ANL), Argonne, IL (United States)

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 tree T that 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 in T or (2) removing leaves from T? Here 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.

View Accepted Manuscript (DOE)

Research Organization:: Argonne National Laboratory (ANL); Argonne National Laboratory (ANL), Argonne, IL (United States)

Sponsoring Organization:: USDOE Office of Electricity (OE)

Grant/Contract Number:: AC02-06CH11357

OSTI ID:: 2500845

Journal Information:: Mathematical Programming, Journal Name: Mathematical Programming Vol. 210; ISSN 0025-5610

Publisher:: SpringerCopyright Statement

Country of Publication:: United States

Language:: English

References (18)

Trivial integer programs unsolvable by branch-and-bound Jeroslow, R. G. Mathematical Programming, Vol. 6, Issue 1 https://doi.org/10.1007/BF01580225	journal	December 1974
Branching on general disjunctions Karamanov, Miroslav; Cornuéjols, Gérard Mathematical Programming, Vol. 128, Issue 1-2 https://doi.org/10.1007/s10107-009-0332-3	journal	December 2009
Improved strategies for branching on general disjunctions Cornuéjols, G.; Liberti, L.; Nannicini, G. Mathematical Programming, Vol. 130, Issue 2 https://doi.org/10.1007/s10107-009-0333-2	journal	December 2009
The integrality number of an integer program Paat, Joseph; Schlöter, Miriam; Weismantel, Robert Mathematical Programming, Vol. 192, Issue 1-2 https://doi.org/10.1007/s10107-021-01651-0	journal	April 2021
Lower bounds on the size of general branch-and-bound trees Dey, Santanu S.; Dubey, Yatharth; Molinaro, Marco Mathematical Programming, Vol. 198, Issue 1 https://doi.org/10.1007/s10107-022-01781-z	journal	February 2022
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices Mehrotra, Sanjay; Li, Zhifeng Journal of Global Optimization, Vol. 49, Issue 4 https://doi.org/10.1007/s10898-010-9554-4	journal	May 2010
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library Gleixner, Ambros; Hendel, Gregor; Gamrath, Gerald Mathematical Programming Computation, Vol. 13, Issue 3 https://doi.org/10.1007/s12532-020-00194-3	journal	January 2021
Achieving MILP feasibility quickly using general disjunctions Mahmoud, Hanan; Chinneck, John W. Computers & Operations Research, Vol. 40, Issue 8 https://doi.org/10.1016/j.cor.2013.03.001	journal	August 2013
Branching rules revisited Achterberg, Tobias; Koch, Thorsten; Martin, Alexander Operations Research Letters, Vol. 33, Issue 1 https://doi.org/10.1016/j.orl.2004.04.002	journal	January 2005
On the Complexity of Selecting Disjunctions in Integer Programming Mahajan, Ashutosh; Ralphs, Ted SIAM Journal on Optimization, Vol. 20, Issue 5 https://doi.org/10.1137/080737587	journal	January 2010
JuMP: A Modeling Language for Mathematical Optimization Dunning, Iain; Huchette, Joey; Lubin, Miles SIAM Review, Vol. 59, Issue 2 https://doi.org/10.1137/15M1020575	journal	January 2017
A Computational Study of Search Strategies for Mixed Integer Programming Linderoth, J. T.; Savelsbergh, M. W. P. INFORMS Journal on Computing, Vol. 11, Issue 2 https://doi.org/10.1287/ijoc.11.2.173	journal	May 1999
Backdoor Branching Fischetti, Matteo; Monaci, Michele INFORMS Journal on Computing, Vol. 25, Issue 4 https://doi.org/10.1287/ijoc.1120.0531	journal	November 2013
MathOptInterface: A Data Structure for Mathematical Optimization Problems Legat, Benoît; Dowson, Oscar; Garcia, Joaquim Dias INFORMS Journal on Computing https://doi.org/10.1287/ijoc.2021.1067	journal	October 2021
Hard Equality Constrained Integer Knapsacks Aardal, Karen; Lenstra, Arjen K. Mathematics of Operations Research, Vol. 29, Issue 3 https://doi.org/10.1287/moor.1040.0099	journal	August 2004
Hard Knapsack Problems Chvátal, Vasek Operations Research, Vol. 28, Issue 6 https://doi.org/10.1287/opre.28.6.1402	journal	December 1980
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework Khalil, Elias B.; Vaezipoor, Pashootan; Dilkina, Bistra Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36, Issue 4 https://doi.org/10.1609/aaai.v36i4.20293	journal	June 2022
Stabbing Planes Beame, Paul; Fleming, Noah; Impagliazzo, Russell Schloss Dagstuhl – Leibniz-Zentrum für Informatik https://doi.org/10.4230/LIPIcs.ITCS.2018.10	conferencepaper	January 2018

Similar Records

BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs

Journal Article · Sat Nov 26 19:00:00 EST 2016 · Operations Research Letters · OSTI ID:1340699

Control strategies for parallel mixed integer branch and bound

Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:87609

Branch-and-cut: Column generation for solving huge integer programs

Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36337

Related Subjects

97 MATHEMATICS AND COMPUTING

Compressing branch-and-bound trees

Citation Formats

References (18)

Similar Records

Related Subjects