"Complexity of min-max-min robustness for combinatorial optimization under ..."

Christoph Buchheim, Jannis Kurtz (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2017.08.006

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/BuchheimK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/BuchheimK18
Christoph Buchheim, Jannis Kurtz:
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. Discret. Optim. 28: 1-15 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.