On learning and branching: a survey
From MaRDI portal
Publication:2408515
DOI10.1007/S11750-017-0451-6zbMath1372.90003OpenAlexW2626188202MaRDI QIDQ2408515
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-0451-6
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) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (30)
Mathematical optimization in classification and regression trees ⋮ Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Theoretical challenges towards cutting-plane selection ⋮ Hybrid offline/online optimization for energy management via reinforcement learning ⋮ Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information ⋮ Learning to steer nonlinear interior-point methods ⋮ Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Online learning for scheduling MIP heuristics ⋮ \textsc{Ner4Opt}: named entity recognition for optimization modelling from natural language ⋮ A nearly optimal randomized algorithm for explorable heap selection ⋮ ReLU neural networks of polynomial size for exact maximum flow computation ⋮ Online Mixed-Integer Optimization in Milliseconds ⋮ Towards Lower Bounds on the Depth of ReLU Neural Networks ⋮ A machine learning optimization approach for last-mile delivery and third-party logistics ⋮ Adaptive solution prediction for combinatorial optimization ⋮ A theoretical and computational analysis of full strong-branching ⋮ Tutorial on Amortized Optimization ⋮ Learning optimal solutions via an LSTM-optimization framework ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Computational advances in polynomial optimization: RAPOSa, a freely available global solver ⋮ Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Optimization problems for machine learning: a survey ⋮ Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Improving branch-and-cut performance by random sampling
- DASH: dynamic approach for switching heuristics
- Information-theoretic approaches to branching in search
- Branching on nonchimerical fractionalities
- Algorithm runtime prediction: methods \& evaluation
- Erratum to: ``An abstract model for branching and its application to mixed integer programming
- Branching rules revisited
- Information-based branching schemes for binary linear mixed integer problems
- MIPLIB 2003
- Early Estimates of the Size of Branch-and-Bound Trees
- Backdoor Branching
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Mixed Integer Programming Computation
- Algorithms for Reinforcement Learning
- Estimating the Efficiency of Backtrack Programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- Exploiting Erraticism in Search
- Experiments in mixed-integer linear programming
- A Machine Learning-Based Approximation of Strong Branching
- Some aspects of the sequential design of experiments
- Extremely randomized trees
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: On learning and branching: a survey
