Reinforcement learning for variable selection in a branch and bound algorithm
From MaRDI portal
Publication:2110404
DOI10.1007/978-3-030-58942-4_12OpenAlexW3090460193MaRDI QIDQ2110404
Côme Bissuel, Safia Kedad-Sidhoum, Olivier Juan, Marc Etheve, Zacharie Ales
Publication date: 21 December 2022
Full work available at URL: https://arxiv.org/abs/2005.10026
neural networkbranch and boundreinforcement learningmixed integer linear programmingbranching strategy
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Related Items (2)
A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference ⋮ Online learning for scheduling MIP heuristics
This page was built for publication: Reinforcement learning for variable selection in a branch and bound algorithm