From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “knapsack problem” 13

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Online Unbounded Knapsack
2024 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

0

citations
Online Simple Knapsack with Reservation Costs
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Boeckenhauer, Elisabet Burjons, Juraj Hromkovic̆, Henri Lotze, Peter Rossmanith

2

citations
Online Knapsack Problems with Estimates
2025 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Jakub Balabán, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker

0

citations
Knapsack Secretary Through Boosting
2022 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer

0

citations
Removable Online Knapsack and Advice
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith

1

citations
Transfer learning of optimal QAOA parameters in combinatorial optimization
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

J. A. Montañez-Barrera, Dennis Willsch, Kristel F. L. Michielsen

3

citations
Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives
2026 arXiv (Cornell University) preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Wei Liu, Yaoxin Wu, Yingqian Zhang, Thomas Bäck, Yingjie Fan

0

citations
Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives
2026 arXiv (Cornell University) preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Wei Liu, Yaoxin Wu, Yingqian Zhang, Thomas Bäck, Yingjie Fan

0

citations
Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives
2026 Research Square preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Wei Liu, Yizhi Wu, Yingqian Zhang, Thomas Bäck, Yingjie Fan

0

citations
The Complexity of Stackelberg Pricing Games
2025 IT University Of Copenhagen (IT University of Copenhagen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

0

citations
Which Algorithms Can Graph Neural Networks Learn?
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, +1 more

0

citations
Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations

13 results