
OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Showing 3 citing articles:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Marcin Briański, Martin Koutecký, Daniel Kráľ, et al.
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 497-531
Open Access
Marcin Briański, Martin Koutecký, Daniel Kráľ, et al.
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 497-531
Open Access
The double exponential runtime is tight for 2-stage stochastic ILPs
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Mathematical Programming (2022) Vol. 197, Iss. 2, pp. 1145-1172
Open Access
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Mathematical Programming (2022) Vol. 197, Iss. 2, pp. 1145-1172
Open Access
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.
Cornelius Brand, Martin Koutecký, Alexandra Lassota, et al.
arXiv (Cornell University) (2021)
Closed Access
Cornelius Brand, Martin Koutecký, Alexandra Lassota, et al.
arXiv (Cornell University) (2021)
Closed Access