Improving branch-and-bound using decision diagrams and reinforcement learning

DOI10.1007/978-3-030-78230-6_28OpenAlexW3168531812MaRDI QIDQ2117248FDOQ2117248

Authors: Yanyan Li 

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_28

zbMATH Keywords

reinforcement learningbranch-and-bounddecision diagrams

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites Work

• On Threshold BDDs and the Optimal Variable Ordering Problem
• Statistical mechanics of complex networks
• Benchmarking optimization software with performance profiles.
• Graph-Based Algorithms for Boolean Function Manipulation
• \({\mathcal Q}\)-learning
• Discrete optimization with decision diagrams
• Manipulating MDD relaxations for combinatorial optimization
• Multivalued decision diagrams for sequencing problems
• Reinforcement learning. An introduction
• An MDD approach to multidimensional bin packing
• Decision diagrams for optimization
• Title not available (Why is that?)
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
• Three-dimensional matching instances are rich in stable matchings

Cited In (3)

• Improving variable orderings of approximate decision diagrams using reinforcement learning
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Uses Software

• azove

This page was built for publication: Improving branch-and-bound using decision diagrams and reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117248)