A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: Optimization and Packing Problems ×

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

Papers matching “knapsack problem” in Optimization and Packing Problems 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

The colored knapsack problem: structural properties and exact algorithms
2026 IRIS Research product catalog (Sapienza University of Rome) other Engineering Optimization and Packing Problems Open access

Fabio Ciccarelli, Alexander Helber, Erik Mühmer

0

citations
A faster algorithm for the continuous bilevel knapsack problem
2020 Operations Research Letters article Engineering Optimization and Packing Problems

Dennis Fischer, Gerhard J. Woeginger

8

citations
Benchmark instances and experimental results for the Colored Knapsack Problem (ColKP)
2026 Zenodo (CERN European Organization for Nuclear Research) dataset Engineering Optimization and Packing Problems Open access

Fabio Ciccarelli, Alexander Helber, Erik Mühmer

0

citations
Benchmark instances and experimental results for the Colored Knapsack Problem (ColKP)
2026 arXiv (Cornell University) preprint Engineering Optimization and Packing Problems Open access

Fabio Ciccarelli, Alexander Helber, Erik Mühmer

0

citations
Online knapsack with removal and recourse
2026 Journal of Computer and System Sciences article Engineering Optimization and Packing Problems Open access

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

0

citations
The subset sum game revisited
2021 Theory of Computing Systems article Engineering Optimization and Packing Problems Open access

Astrid Pieterse, Gerhard J. Woeginger

1

citations

6 results