Open AccessProvably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
Author(s) -
Christoph Hertrich,
Martin Skutella
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i9.16939
Subject(s) - knapsack problem , change making problem , continuous knapsack problem , mathematical optimization , polynomial time approximation scheme , mathematics , cutting stock problem , rounding , artificial neural network , dynamic programming , combinatorial optimization , generalized assignment problem , optimization problem , computer science , artificial intelligence , operating system
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom