Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning
From MaRDI portal
Publication:5058000
DOI10.1287/ijoc.2022.1194zbMath1502.90088OpenAlexW4229001783MaRDI QIDQ5058000
No author found.
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1194
Learning and adaptive systems in artificial intelligence (68T05) Management decision making, including multiple objectives (90B50)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision diagrams for optimization
- Progress in presolving for mixed integer programming
- Geometric algorithms and combinatorial optimization.
- Learning heuristics for the TSP by policy gradient
- Improving the linear programming technique in the search for lower bounds in secret sharing
- \({\mathcal Q}\)-learning
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Improving branch-and-bound using decision diagrams and reinforcement learning
- On learning and branching: a survey
- Discrete Optimization with Decision Diagrams
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Statistical mechanics of complex networks
- Graph-Based Algorithms for Boolean Function Manipulation
- State-space relaxation procedures for the computation of bounds to routing problems
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Learning representations by back-propagating errors
- Benchmarking optimization software with performance profiles.
