Learning pseudo-backdoors for mixed integer programs
From MaRDI portal
Publication:2170189
DOI10.1007/978-3-031-08011-1_8zbMath1502.90111arXiv2106.05080OpenAlexW3197542688MaRDI QIDQ2170189
Yisong Yue, Aaron Ferber, Jialin Song, Bistra Dilkina
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2106.05080
Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision diagrams for optimization
- A comparison of heuristics and relaxations for the capacitated plant location problem
- The generalized independent set problem: polyhedral analysis and solution approaches
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Backdoor Branching
- Integer Programming
- Limitations of Restricted Branching in Clause Learning
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- An Automatic Method for Solving Discrete Programming Problems
- Backdoors to Combinatorial Optimization: Feasibility and Optimality
- Backdoors in the Context of Learning
- ParamILS: An Automatic Algorithm Configuration Framework
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Mixed Integer Programming: Analyzing 12 Years of Progress
