Learning to branch: generalization guarantees and limits of data-independent discretization
From MaRDI portal
branch-and-boundconstraint satisfaction problemsInteger programminglearning theoryparameter tuningtree search
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
- A machine learning-based approximation of strong branching
- A PAC approach to application-specific algorithm selection
- Algorithm for optimal winner determination in combinatorial auctions
- Algorithm portfolios
- Algorithm runtime prediction: methods \& evaluation
- An Automatic Method of Solving Discrete Programming Problems
- Branch and Bound Methods for Mathematical Programming Systems
- Branching rules revisited
- Combining Multiple Heuristics
- DASH: dynamic approach for switching heuristics
- Dispersion for data-driven algorithm design, online learning, and private optimization
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Experiments in mixed-integer linear programming
- Experiments in mixed-integer linear programming using pseudo-costs
- Foundations of machine learning
- scientific article; zbMATH DE number 5602305 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 7788373 (Why is no real title available?)
- Information-theoretic approaches to branching in search
- Learning a classification of mixed-integer quadratic programming problems
- Learning rate based branching heuristic for SAT solvers
- Learning to select branching rules in the DPLL procedure for satisfiability
- Learning when to use a decomposition
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- On the complexity of choosing the branching literal in DPLL
- Paramils: an automatic algorithm configuration framework
- Rademacher penalties and structural risk minimization
- SATzilla: portfolio-based algorithm selection for SAT
- SCIP: solving constraint integer programs
- Smoothed analysis of algorithms
- Some applications of concentration inequalities to statistics
- Trivial integer programs unsolvable by branch-and-bound
- Understanding machine learning. From theory to algorithms
This page was built for publication: Learning to branch: generalization guarantees and limits of data-independent discretization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031248)
