The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Learning to Branch in Mixed Integer Programming
Open accessAbstract
The design of strategies for branching in Mixed Integer Programming (MIP) is guided by cycles of parameter tuning and offline experimentation on an extremely heterogeneous testbed, using the average performance. Once devised, these strategies (and their parameter settings) are essentially input-agnostic. To address these issues, we propose a machine learning (ML) framework for variable branching in MIP.Our method observes the decisions made by Strong Branching (SB), a time-consuming strategy that produces small search trees, collecting features that characterize the candidate branching variables at each node of the tree. Based on the collected data, we learn an easy-to-evaluate surrogate function that mimics the SB strategy, by means of solving a learning-to-rank problem, common in ML. The learned ranking function is then used for branching. The learning is instance-specific, and is performed on-the-fly while executing a branch-and-bound search to solve the MIP instance. Experiments on benchmark instances indicate that our method produces significantly smaller search trees than existing heuristics, and is competitive with a state-of-the-art commercial solver.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Self-citationOptimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Bandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
ParamILS: An Automatic Algorithm Configuration Framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stuetzle, T. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2861 · Cited by 882
Best subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval
Liu, T., Xu, J., Qin, T., Xiong, W., & Li, H. (2007) · Cited by 419
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02 · doi:10.1145/775066.775067 · Cited by 401
A Computational Study of Search Strategies for Mixed Integer Programming
Linderoth, J., & Savelsbergh, M. W. P. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.173 · Cited by 376
Learning to Search in Branch and Bound Algorithms
He, H., Daumé, H., & Eisner, J. M. (2014) · neural information processing systems · Cited by 275
Mixed Integer Programming: Analyzing 12 Years of Progress
Achterberg, T., & Wunderling, R. (2013) · Facets of Combinatorial Optimization · doi:10.1007/978-3-642-38189-8_18 · Cited by 220
ISAC – Instance-Specific Algorithm Configuration
Kadıoğlu, S., Malitsky, Y., Sellmann, M., & Tierney, K. (2010) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-60750-606-5-751 · Cited by 192
Integer linear programming inference for conditional random fields
Roth, D., & Yih, W.-T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102444 · Cited by 179
The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List
Rudin, C. D. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.5555/1577069.1755861 · Cited by 136
Performance Variability in Mixed-Integer Programming
Lodi, A., & Tramontani, A. (2013) · doi:10.1287/educ.2013.0112 · Cited by 136
Instance-Specific Algorithm Configuration
Malitsky, Y. (2014) · Springer eBooks · doi:10.1007/978-3-319-11230-5 · Cited by 78
Learning from multiple heuristics
Samadi, M., Felner, A., & Schaeffer, J. (2008) · Cited by 51
A Supervised Machine Learning Approach to Variable Branching in Branch-And-Bound
Alvarez, A. M., Louveaux, Q., & Wehenkel, L. A. (2014) · Cited by 32
Branching on nonchimerical fractionalities
Fischetti, M., & Monaci, M. (2012) · Operations Research Letters · doi:10.1016/j.orl.2012.01.008 · Cited by 21
Using expectation maximization to find likely assignments for solving CSP's
Hsu, E. I., Kitching, M., Bacchus, F., & Mcllraith, S. A. (2007) · Cited by 16
Cited by
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
Self-citationOptimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Learning Heuristics for the TSP by Policy Gradient
Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., & Rousseau, L.-M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93031-2_12 · Cited by 303
Machine learning for combinatorial optimization: A methodological tour d'horizon
Bengio, Y., Lodi, A., & Prouvost, A. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.07.063 · Cited by 195
LORM: Learning to Optimize for Resource Management in Wireless Networks With Few Training Samples
Shen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2947591 · Cited by 134
Metadata
- Authors
- Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., & Dilkina, B.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2016-02-21
- Volume
- 30
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2563592268
- Cited by
- 298
- References
- 22
- FWCI
- 27.92
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.