Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty

Research article (Discrete Optimization, 2017) · cited 14× · AI/ML

academia openalex:W2767276898

Press Enter · cited answer in seconds

Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty

Summary

Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty is a scholarly article^[1].

Key Facts

Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 1

Jannis Kurtz

← Author of 1

Jannis Kurtz

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty. Retrieved May 24, 2026, from https://4ort.xyz/entity/complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty

MLA

“Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty.

BibTeX

@misc{4ortxyz_complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty}}, year = {2026}, url = {https://4ort.xyz/entity/complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty — https://4ort.xyz/entity/complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/complexity-of-minmaxmin-robustness-for-combinatorial-optimization-under-discrete-uncertainty · Last refreshed: May 24, 2026