Learn More
In robust optimization, the multi-stage context (or dynamic decision-making) assumes that the information is revealed in stages. So, part of the decisions must be taken before knowing the real values of the uncertain parameters, and another part, called recourse decisions, is taken when the information is known. In this paper, we are interested in a robust(More)
We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems (MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between left-and right-hand sides of the extended cover inequality looked(More)
This paper provides an overview of developments in robust optimization since 2007. It seeks to give a representative picture of the research topics most explored in recent years, highlight common themes in the investigations of independent research teams and highlight the contributions of rising as well as established researchers both to the theory of(More)
1 Abstract In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists in(More)