Compressing branch-and-bound trees

DOI10.1007/S10107-024-02080-5MaRDI QIDQ7019057zbMATH OpenFDO

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

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://www.osti.gov/biblio/2500845

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

This page was built for publication: Compressing branch-and-bound trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019057)