A Machine Learning-Based Approximation of Strong Branching
From MaRDI portal
Publication:5739140
DOI10.1287/ijoc.2016.0723zbMath1364.90224OpenAlexW2576311753MaRDI QIDQ5739140
Quentin Louveaux, Louis Wehenkel, Alejandro Marcos Alvarez
Publication date: 2 June 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0de4cea40644bf1c75b4c92bcc493d85b15c81c2
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems ⋮ Theoretical challenges towards cutting-plane selection ⋮ Exact makespan minimization of unrelated parallel machines ⋮ Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ On learning and branching: a survey ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Online Mixed-Integer Optimization in Milliseconds ⋮ Towards Lower Bounds on the Depth of ReLU Neural Networks ⋮ A theoretical and computational analysis of full strong-branching ⋮ Learning to repeatedly solve routing problems ⋮ Optimization Bounds from the Branching Dual ⋮ Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks ⋮ Further results on an abstract model for branching and its application to mixed integer programming ⋮ Learning when to use a decomposition ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Data-driven algorithm selection and tuning in optimization and signal processing ⋮ The voice of optimization ⋮ 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
