相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Two-Stage robust optimization problems with two-stage uncertainty
Marc Goerigk et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
Artur Alves Pessoa et al.
OPERATIONS RESEARCH (2021)
Two-stage combinatorial optimization problems under risk
Marc Goerigk et al.
THEORETICAL COMPUTER SCIENCE (2020)
A survey of adjustable robust optimization
Ihsan Yanikoglu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
Robust combinatorial optimization with knapsack uncertainty
Michael Poss
DISCRETE OPTIMIZATION (2018)
On recoverable and two-stage robust selection problems with budgeted uncertainty
Andre Chassein et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
Robust combinatorial optimization under convex and discrete cost uncertainty
Christoph Buchheim et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2018)
Min-max-min robust combinatorial optimization
Christoph Buchheim et al.
MATHEMATICAL PROGRAMMING (2017)
Robust recoverable recoverable and two-stage selection problems
Adam Kasperski et al.
DISCRETE APPLIED MATHEMATICS (2017)
Robust optimization approach for a chance-constrained binary knapsack problem
Jinil Han et al.
MATHEMATICAL PROGRAMMING (2016)
Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
Amir Ardestani-Jaafari et al.
OPERATIONS RESEARCH (2016)
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
Bita Tadayon et al.
JOURNAL OF SCHEDULING (2015)
K-Adaptability in Two-Stage Robust Binary Programming
Grani A. Hanasusanto et al.
OPERATIONS RESEARCH (2015)
Approximability of the robust representatives selection problem
Adam Kasperski et al.
OPERATIONS RESEARCH LETTERS (2015)
Complexity and in-approximability of a selection problem in robust optimization
Vladimir G. Deineko et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2013)
Solving two-stage robust optimization problems using a column-and-constraint generation method
Bo Zeng et al.
OPERATIONS RESEARCH LETTERS (2013)
Min-max and min-max (relative) regret approaches to representatives selection problem
Alexandre Dolgui et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2012)
Recoverable robust shortest path problems
Christina Buesing
NETWORKS (2012)
On the approximability of robust spanning tree problems
Adam Kasperski et al.
THEORETICAL COMPUTER SCIENCE (2011)
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Hassene Aissi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
On the approximability of minmax (regret) network optimization problems
Adam Kasperski et al.
INFORMATION PROCESSING LETTERS (2009)
Commitment under uncertainty: Two-stage stochastic matching problems
Irit Katriel et al.
THEORETICAL COMPUTER SCIENCE (2008)
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
David B. Shmoys et al.
JOURNAL OF THE ACM (2006)
On the random 2-stage minimum spanning tree
AD Flaxman et al.
RANDOM STRUCTURES & ALGORITHMS (2006)
Adjustable robust solutions of uncertain linear programs
A Ben-Tal et al.
MATHEMATICAL PROGRAMMING (2004)
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
E Conde
MATHEMATICAL PROGRAMMING (2004)
On the complexity of a class of combinatorial optimization problems with uncertainty
I Averbakh
MATHEMATICAL PROGRAMMING (2001)
分享论文
