From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Reset

Papers matching “integer programming” in Complexity and Algorithms in Graphs 10

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Persistency of Linear Programming Relaxations for the Stable Set Problem
2020 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge

2

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
Branch-Price-and-Cut
2026 Springer eBooks book-chapter Computer Science Complexity and Algorithms in Graphs Open access

Jacques Desrosiers, Marco E. Lübbecke, Guy Desaulniers, Jean Bertrand Gauthier

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

1

citations
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Alexander Helber, Oliver Bachtler, Tom Wüllner

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
Branch-and-price strikes back for the k-vertex cut problem
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Fabio Ciccarelli, Fabio Furini, Christopher Hojny, Marco E. Lübbecke

0

citations
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne, Lasse Wulf

4

citations
Special issue on: Computational discrete optimization
2020 EURO Journal on Computational Optimization editorial Computer Science Complexity and Algorithms in Graphs Open access

Arie M. C. A. Koster, Clemens Thielen

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

10 results