We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which such an efficient algorithm exists as well as problems for which no efficient algorithm exists under mild complexity theoretic assumptions.

中文翻译：

---

多目标组合优化的输出敏感型复杂度

我们研究输出敏感算法和多目标组合优化问题的复杂性。在此计算复杂性框架中，如果一般枚举问题的算法对输出敏感，则认为该算法高效，即，其运行时间受输入和输出大小的多项式限制。我们提供了存在这种有效算法的MOCO问题的实际示例，以及在轻度复杂性理论假设下不存在有效算法的问题。