default search action

combined dblp search
author search
venue search
publication search

ask others

"Faster algorithms for min-max-min robustness for combinatorial problems ..."

André B. Chassein et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2019.05.045

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/ChasseinGKP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/ChasseinGKP19
André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss:
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279(2): 308-319 (2019)

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.