Solving the binary knapsack problem using tabular and deep reinforcement learning algorithms
The knapsack problem (KP) is a traditional optimization problem. Its applicability in the real-world ranges from route selection in logistics and portfolio optimization in finance to energy and server load balancing. Within this study, we tested the viability and effectiveness of the use of Reinforc...
| Published: |
|
|---|---|
| Online Access: | http://hdl.handle.net/2047/D20410381 |