Extended formulations for the min-max-min problem with few recourse solutions

EasyChair Preprint 2493

2 pages•Date: January 29, 2020

Marco Silva, Ayse Nur Arslan and Michael Poss

Abstract

We consider a decomposition algorithm for min-max-min robust optimization problems.

Keyphrases: decomposition, mathematical programming, min-max-min, robust optimization

Links:

https://easychair.org/publications/preprint/RF46

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@booklet{EasyChair:2493,
  author    = {Marco Silva and Ayse Nur Arslan and Michael Poss},
  title     = {Extended formulations for the min-max-min problem with few recourse solutions},
  howpublished = {EasyChair Preprint 2493},
  year      = {EasyChair, 2020}}

Download PDF Open PDF in browser