Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty

Given a nominal combinatorial optimization problem, we consider a robust two-stages variant with polyhedral cost uncertainty, called Decision-Dependent Information Discovery (DDID). In the first stage, DDID selects a subset of uncertain cost coefficients to be observed, and in the second-stage, DDID...

Olles dieđut

Bibliográfalaš dieđut

Váldodahkkit:	Omer, Jérémy, Poss, Michael, Rougier, Maxime
Materiálatiipa:	Artigo
Giella:	Inglês
Almmustuhtton:	Université de Montpellier 2024-09-01
Ráidu:	Open Journal of Mathematical Optimization
Fáttát:	robust combinatorial optimization compact formulations column generation cutting plane.
Liŋkkat:	https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.33/
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!