A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “integer programming formulation” 4

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
A Risk-Sensitive Task Offloading Strategy for Edge Computing in Industrial Internet of Things
2020 Research Square preprint Computer Science IoT and Edge/Fog Computing Open access

Xiaoyu Hao, Ruohai Zhao, Tao Yang, Yulin Hu, Bo Hu, Yuhe Qiu

0

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

4 results