scientific article; zbMATH DE number 7788373

DOI10.5555/3458064.3458099MaRDI QIDQ6147284zbMATH OpenFDO

Authors Santanu S. Dey, Yatharth Dubey, Marco Molinaro

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458099

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• On polytopes with linear rank with respect to generalizations of the split closure
• On computing small variable disjunction branch-and-bound trees
• An abstract model for branch and cut
• Solving a random asymmetric TSP exactly in quasi-polynomial time w.h.p.
• Learning to branch: generalization guarantees and limits of data-independent discretization
• Branching with a pre-specified finite list of k-sparse split sets for binary MIPs

This page was built for publication:

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