From

Institution

Field

Type

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

Reset

Papers matching “knapsack problem” 31

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Online Unbounded Knapsack
2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access

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

2

citations
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
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Kübra Güven, Moritz Stocker

0

citations
Online General Knapsack with Reservation Costs
2025 RWTH Publications (RWTH Aachen) conference-paper Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations
Online knapsack with removal and recourse
2025 Journal of Computer and System Sciences article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

1

citations
Improved Results for Knapsack with Removal
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Valentin Hächler, Dennis Komm, Richard Královič

0

citations
Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space
2023 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Evolutionary Algorithms and Applications Open access

Alejandro Marrero, Eduardo Segredo, Emma Hart, Jakob Bossek, Aneta Neumann

6

citations
A survey of online knapsack problems
2025 Discrete Applied Mathematics article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Dennis Komm, Peter Rossmanith, Moritz Stocker

3

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
Online Knapsack with Removal and Recourse
2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

6

citations
Online General Knapsack with Reservation Costs
2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations
Online Knapsack Problems with Estimates
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Jakub Balabán

0

citations
Knapsack Secretary Through Boosting
2022 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

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

2

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
Online Simple Knapsack with Reservation Costs
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic̆, Henri Lotze, Peter Rossmanith

4

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

1

citations
Semi online problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

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
Transfer learning of optimal QAOA parameters in combinatorial optimization
2025 Quantum Information Processing article Computer Science Quantum Computing Algorithms and Architecture

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

16

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 smoothed number of Pareto-optimal solutions in bicriteria integer optimization
2022 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking

2

citations