Provably good solutions to the knapsack problem via neural networks of bounded size
Year of publication: |
2023
|
---|---|
Authors: | Hertrich, Christoph ; Skutella, Martin |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 35.2023, 5, p. 1079-1097
|
Subject: | dynamic programming | expressive power | knapsack problem | neural networks | Neuronale Netze | Neural networks | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung | Dynamic programming |
-
A 3-space dynamic programming heuristic for the cubic knapsack problem
Dan Dije, Ibrahim, (2024)
-
On the exact separation of cover inequalities of maximum depth
Catanzaro, Daniele, (2021)
-
A dynamic programming-based approach for cloud instance type selection and optimisation
Wang, Pengwei, (2020)
- More ...
-
Scheduling a proportionate flow shop of batching machines
Hertrich, Christoph, (2020)
-
Online algorithms to schedule a proportionate flexible flow shop of batching machines
Hertrich, Christoph, (2022)
-
Scheduling a proportionate flow shop of batching machines
Hertrich, Christoph, (2020)
- More ...