Reinforcement learning for the knapsack problem

DOI10.1007/978-3-030-86286-2_1MaRDI QIDQ2089607zbMATH OpenOpenAlexFDO

Authors Jacopo Pierotti, Maximilian Kronmueller, Javier Alonso-Mora, J. Theresia van Essen, Wendelin Böhmer

Publication date 23 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-86286-2_1

zbMATH Keywords

end-to-endknapsack problemmulti-task DQNreinforcement learningself-attentiontransformer

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Reinforcement learning for combinatorial optimization: a survey
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Learning heuristics for the TSP by policy gradient
• A RNN-based hyper-heuristic for combinatorial problems
• scientific article; zbMATH DE number 1302173

Cites work

• \({\mathcal Q}\)-learning
• Adaptive subgradient methods for online learning and stochastic optimization
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Reinforcement learning. An introduction
• Where are the hard knapsack problems?

Cited in

(6)

• Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
• An investigation into prediction + optimisation for the knapsack problem
• Reinforcement learning for combinatorial optimization: a survey
• scientific article; zbMATH DE number 1983206 (Why is no real title available?)
• High generalization performance structured self-attention model for knapsack problem
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack

Describes a project that uses

Uses Software

• Tensor2Tensor
• AdaGrad

This page was built for publication: Reinforcement learning for the knapsack problem

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