Download PDFOpen PDF in browser

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

EasyChair Preprint no. 2493

2 pagesDate: January 30, 2020

Abstract

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

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

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 no. 2493},

  year = {EasyChair, 2020}}
Download PDFOpen PDF in browser