Login / Signup
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems.
Yu Yang
Natashia Boland
Bistra Dilkina
Martin W. P. Savelsbergh
Published in:
Eur. J. Oper. Res. (2022)
Keyphrases
</>
set covering
knapsack problem
maximum profit
set covering problem
learning algorithm
learning process
greedy algorithm
packing problem
reinforcement learning
constraint satisfaction
column generation