ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2306.05905
  4. Cited By
TreeDQN: Learning to minimize Branch-and-Bound tree

TreeDQN: Learning to minimize Branch-and-Bound tree

9 June 2023
Dmitry Sorokin
A. Kostin
ArXivPDFHTML

Papers citing "TreeDQN: Learning to minimize Branch-and-Bound tree"

3 / 3 papers shown
Title
Discounted Pseudocosts in MILP
Discounted Pseudocosts in MILP
Krunal Kishor Patel
25
0
0
07 Jul 2024
Learning to branch with Tree MDPs
Learning to branch with Tree MDPs
Lara Scavuzzo
F. Chen
Didier Chételat
Maxime Gasse
Andrea Lodi
Neil Yorke-Smith
K. Aardal
AI4CE
35
51
0
23 May 2022
Reinforcement Learning Enhanced Quantum-inspired Algorithm for
  Combinatorial Optimization
Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization
D. Beloborodov
Alexander Ulanov
Jakob N. Foerster
Shimon Whiteson
A. I. L. R. Q. Center
32
21
0
11 Feb 2020
1