Empowering branch-and-bound algorithms via reinforcement and imitation learning for enhanced search

This publication has 29 references indexed in Scilit:

• Dynamic programming with meta-reinforcement learning: a novel approach for multi-objective optimization
  Complex & Intelligent Systems, 2024
• Routing optimization with Monte Carlo Tree Search-based multi-agent reinforcement learning
  Applied Intelligence, 2023
• Solving combinatorial optimization problems over graphs with BERT-Based Deep Reinforcement Learning
  Information Sciences, 2022
• Generative Adversarial Imitation Learning to Search in Branch-and-Bound Algorithms
  2022
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
  European Journal of Operational Research, 2021
• Integrated order batching and vehicle routing operations in grocery retail – A General Adaptive Large Neighborhood Search algorithm
  European Journal of Operational Research, 2021
• Reinforcement learning for combinatorial optimization: A survey
  Computers & Operations Research, 2021
• A survey of inverse reinforcement learning: Challenges, methods and progress
  Artificial Intelligence, 2021
• Imitation Learning
  2020
• Survey of imitation learning for robotic manipulation
  International Journal of Intelligent Robotics and Applications, 2019