From

Institution

Field

Type

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

Reset

Papers matching “combinatorial optimization” 142

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

A study on the effects of normalized TSP features for automated algorithm selection
2022 Theoretical Computer Science article Computer Science Metaheuristic Optimization Algorithms Research

Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Vinzent Seiler, Heike Trautmann, Pascal Kerschke

16

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
Automatic Mapping of Parallel Pattern-Based Algorithms on Heterogeneous Architectures
2021 Lecture notes in computer science conference-paper Computer Science Parallel Computing and Optimization Techniques

Lukas Trümper, Julian Miller, Christian Terboven

3

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
Sustainable Benchmarking Tool (Tool Paper)
2026 Repository KITopen (Karlsruhe Institute of Technology) conference-paper Computer Science Constraint Satisfaction and Optimization Open access

Dipl.-Inform. Markus Iser, Marie Anastacio, Théo Matricon, Laurent Simon, Holger H. Hoos, Alexey Ignatiev, +1 more

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
Quantum annealing with trigger Hamiltonians: Application to 2-satisfiability and nonstoquastic problems
2021 Physical Review A article Computer Science Quantum Computing Algorithms and Architecture Open access

Vrinda Mehta, Fengping Jin, Hans A. De Raedt, Kristel F. L. Michielsen

13

citations
A linear time algorithm for the robust recoverable selection problem
2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger

9

citations
Performance of quantum annealing for 2-satisfiability problems with multiple satisfying assignments
2025 Physical Review A article Computer Science Quantum Computing Algorithms and Architecture Open access

Hans A. De Raedt, Kristel F. L. Michielsen, Fengping Jin

5

citations
Recognising permuted Demidenko matrices
2023 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

4

citations
Hierarchical Service Composition via Blockchain-enabled Federated Learning
2024 Data Science and Engineering article Computer Science Service-Oriented Architecture and Web Services Open access

Li Huang, Lu Zhao, Yansong Liu, Yao Zhao

3

citations
Learning-Driven Annealing with Adaptive Hamiltonian Modification for Solving Large-Scale Problems on Quantum Devices
2025 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Sebastian Schulz, Dennis Willsch, Kristel F. L. Michielsen

2

citations
The bipartite travelling salesman problem: A pyramidally solvable case
2024 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Vladimir G. Deı̌neko, Bettina Klinz, Gerhard J. Woeginger

2

citations
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Michael Emmerich, Ksenia Pereverdieva, Andre H. Deutz

0

citations
Correction: Benchmarking quantum annealing with maximum cardinality matching problems
2025 Frontiers in Computer Science erratum Computer Science Quantum Computing Algorithms and Architecture Open access

Daniel Vert, Madita Willsch, Berat Yenilen, Renaud Sirdey, Stéphane Louise, Kristel F. L. Michielsen

0

citations
Unsplittable Cost Flows from Unweighted Error-Bounded Variants
2026 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Complexity and Algorithms in Graphs

Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen

0

citations
Data and Implementation: Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored Permutations
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah

0

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

0

citations
Data and Implementation: Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored Permutations
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah

0

citations
Requirements for Early Quantum Utility and Quantum Utility in the Capacitated Vehicle Routing Problem
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
CE4IO: Code to Paper
2025 arXiv (Cornell University) preprint Computer Science Explainable Artificial Intelligence (XAI) Open access

Jannis Kurtz, Ş. İlker Birbil, Ted K. Ralphs

0

citations
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

0

citations
Optimal Vaccination Strategies for Multiple Dose Vaccinations
2022 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Jenny Segschneider, Arie M. C. A. Koster

0

citations
Learning General Policies with Policy Gradient Methods
2023 conference-paper Computer Science Reinforcement Learning in Robotics Open access

Simon Ståhlberg, Blai Bonet, Héctor Geffner

10

citations
Learning General Policies with Policy Gradient Methods
2025 arXiv (Cornell University) preprint Computer Science Reinforcement Learning in Robotics Open access

Simon Ståhlberg, Blai Bonet, Héctor Geffner

0

citations