Abstract: Robust multiobjective optimization problems (RMOPs) widely exist in real-world applications, which introduce a variety of uncertainty in optimization models. While some evolutionary ...
Since combinatorial optimization problems (COPs) are a class of non-deterministic polynomial-time (NP)-hard problems, it is impracticable to solve them in brute-force searches, which results in high ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback