A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection
2015
Omega : The International Journal of Management Science
Multi-objective combinatorial optimization (MOCO) problems, apart from being notoriously difficult and complex to solve in reasonable computational time, they also exhibit high levels of instability in their results in case of uncertainty, which often deviate far from optimality. In this work we propose an integrated methodology to measure and analyze the robustness of MOCO problems, and more specifically multi-objective integer programming ones, given the imperfect knowledge of their
doi:10.1016/j.omega.2014.11.005
fatcat:bo22xeglovhnzk7vrwkljfjazi