Michael Poss
AuthID: R-001-013
1
TITLE: Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions Full Text
AUTHORS: Arslan, Ayse N.; Poss, Michael; Silva, Marco ;
PUBLISHED: 2022, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 34, ISSUE: 4
AUTHORS: Arslan, Ayse N.; Poss, Michael; Silva, Marco ;
PUBLISHED: 2022, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 34, ISSUE: 4
2
TITLE: Robust inventory theory with perishable products Full Text
AUTHORS: Marcio Costa Santos; Agostinho Agra; Michael Poss;
PUBLISHED: 2020, SOURCE: ANNALS OF OPERATIONS RESEARCH, VOLUME: 289, ISSUE: 2
AUTHORS: Marcio Costa Santos; Agostinho Agra; Michael Poss;
PUBLISHED: 2020, SOURCE: ANNALS OF OPERATIONS RESEARCH, VOLUME: 289, ISSUE: 2
INDEXED IN: 
Scopus 
WOS
Scopus WOS3
TITLE: Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty Full Text
AUTHORS: Marco Silva ; Michael Poss; Nelson Maculan;
PUBLISHED: 2020, SOURCE: European Journal of Operational Research, VOLUME: 283, ISSUE: 1
AUTHORS: Marco Silva ; Michael Poss; Nelson Maculan;
PUBLISHED: 2020, SOURCE: European Journal of Operational Research, VOLUME: 283, ISSUE: 1
4
TITLE: Optimizing make-to-stock policies through a robust lot-sizing model
AUTHORS: Agra, A; Poss, M; Santos, M;
PUBLISHED: 2018, SOURCE: International Journal of Production Economics, VOLUME: 200
AUTHORS: Agra, A; Poss, M; Santos, M;
PUBLISHED: 2018, SOURCE: International Journal of Production Economics, VOLUME: 200
INDEXED IN: Scopus
Scopus5
TITLE: Solving the bifurcated and nonbifurcated robust network loading problem withk-adaptive routing Full Text
AUTHORS: Marco Silva ; Michael Poss; Nelson Maculan;
PUBLISHED: 2018, SOURCE: Networks, VOLUME: 72, ISSUE: 1
AUTHORS: Marco Silva ; Michael Poss; Nelson Maculan;
PUBLISHED: 2018, SOURCE: Networks, VOLUME: 72, ISSUE: 1
6
TITLE: k-Adaptive Routing for the Robust Network Loading Problem Full Text
AUTHORS: Silva, M ; Poss, M; Maculan, N;
PUBLISHED: 2018, SOURCE: Electronic Notes in Discrete Mathematics, VOLUME: 64
AUTHORS: Silva, M ; Poss, M; Maculan, N;
PUBLISHED: 2018, SOURCE: Electronic Notes in Discrete Mathematics, VOLUME: 64
7
TITLE: A DYNAMIC PROGRAMMING APPROACH FOR A CLASS OF ROBUST OPTIMIZATION PROBLEMS Full Text
AUTHORS: Agostinho Agra; Marcio Costa Santos; Dritan Nace; Michael Poss;
PUBLISHED: 2016, SOURCE: SIAM JOURNAL ON OPTIMIZATION, VOLUME: 26, ISSUE: 3
AUTHORS: Agostinho Agra; Marcio Costa Santos; Dritan Nace; Michael Poss;
PUBLISHED: 2016, SOURCE: SIAM JOURNAL ON OPTIMIZATION, VOLUME: 26, ISSUE: 3
8
TITLE: Benders Decomposition for the Hop-Constrained Survivable Network Design Problem Full Text
AUTHORS: Quentin Botton; Bernard Fortz; Luis Gouveia ; Michael Poss;
PUBLISHED: 2013, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 25, ISSUE: 1
AUTHORS: Quentin Botton; Bernard Fortz; Luis Gouveia ; Michael Poss;
PUBLISHED: 2013, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 25, ISSUE: 1
9
TITLE: Affine recourse for the robust network design problem: Between static and dynamic routing Full Text
AUTHORS: Michael Poss; Christian Raack;
PUBLISHED: 2013, SOURCE: NETWORKS, VOLUME: 61, ISSUE: 2
AUTHORS: Michael Poss; Christian Raack;
PUBLISHED: 2013, SOURCE: NETWORKS, VOLUME: 61, ISSUE: 2
10
TITLE: Robust combinatorial optimization with variable budgeted uncertainty Full Text
AUTHORS: Michael Poss;
PUBLISHED: 2013, SOURCE: 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, VOLUME: 11, ISSUE: 1
AUTHORS: Michael Poss;
PUBLISHED: 2013, SOURCE: 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, VOLUME: 11, ISSUE: 1
