Comments on: ``On learning and branching: a survey
From MaRDI portal
Publication:5971157
DOI10.1007/s11750-017-0454-3zbMath1372.90116OpenAlexW2626674286MaRDI QIDQ5971157
Bistra Dilkina, Elias B. Khalil, Nemhauser, George I.
Publication date: 12 October 2017
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-017-0454-3
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Rejoinder on: ``On learning and branching: a survey ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- SCIP: solving constraint integer programs
- Erratum to: ``An abstract model for branching and its application to mixed integer programming
- Learning when to use a decomposition
- Information-based branching schemes for binary linear mixed integer problems
- Faster MIP solutions via new node selection rules
- Random sampling and machine learning to understand good decompositions
- A PAC Approach to Application-Specific Algorithm Selection
- Mixed Integer Programming: Analyzing 12 Years of Progress
This page was built for publication: Comments on: ``On learning and branching: a survey