Solving hard bi-objective knapsack problems using deep reinforcement learning
Authors:
- Hadi CharkhgardHCHadi Charkhgard
- Hanieh Rastegar MoghaddamHMHanieh Rastegar Moghaddam
- Ali EshraghAEAli Eshragh
- Sasan MahmoudinazlouSMSasan Mahmoudinazlou
- Kimia KeshanianKKKimia Keshanian
- 9 February 2025
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 55
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problemsJournal of Global Optimization, 2023
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approachComputers & Operations Research, 2022
- Revisiting where are the hard knapsack problems? via Instance Space AnalysisComputers & Operations Research, 2021
- FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programmingComputers & Operations Research, 2019
- An exact algorithm for biobjective mixed integer linear programming problemsComputers & Operations Research, 2016
- The L-shape search method for triobjective integer programmingMathematical Programming Computation, 2015
- Multi-directional local searchComputers & Operations Research, 2012
- Finding all nondominated points of multi-objective integer programsJournal of Global Optimization, 2012
- Where are the hard knapsack problems?Computers & Operations Research, 2005
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000