A theoretical and computational analysis of full strong-branching

DOI10.1007/s10107-023-01977-xarXiv2110.10754OpenAlexW3206164169MaRDI QIDQ6126652

Santanu S. Dey, Yatharth Dubey, Prachi Shah, Marco Molinaro

Publication date: 9 April 2024

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

Full work available at URL: https://arxiv.org/abs/2110.10754

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting planes from extended LP formulations
• Capacitated lot-sizing with extensions: a review
• Sample average approximation method for chance constrained programming: Theory and applications
• An abstract model for branching and its application to mixed integer programming
• Branching rules revisited
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• On learning and branching: a survey
• Covering Linear Programming with Violations
• Integer Programming
• An Automatic Method of Solving Discrete Programming Problems
• Computer Codes for Problems of Integer Programming
• Hard Knapsack Problems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Vertex packings: Structural properties and algorithms
• On the integer-valued variables in the linear vertex packing problem
• Experiments in mixed-integer linear programming using pseudo-costs
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A Computational Study of Search Strategies for Mixed Integer Programming
• Properties of vertex packing and independence system polyhedra
• Trivial integer programs unsolvable by branch-and-bound
• Parameterized Algorithms
• A tree-search algorithm for mixed integer programming problems
• Experiments in mixed-integer linear programming
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
• A Machine Learning-Based Approximation of Strong Branching
• On the integrality gap of binary integer programs with Gaussian data

This page was built for publication: A theoretical and computational analysis of full strong-branching