A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: Optimization and Search Problems ×

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

Papers matching “combinatorial optimization” in Optimization and Search Problems 5

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
Upper and lower bounds for competitive group testing
2023 Discrete Applied Mathematics article Computer Science Optimization and Search Problems

Robert Scheidweiler, Eberhard Triesch

1

citations
Upper and Lower Bounds for Competitive Group Testing
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Robert Scheidweiler, Eberhard Triesch

0

citations

5 results