Output-sensitive complexity of multiobjective combinatorial optimization

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, that is, its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of multiobjective combinatorial optimization problems for which such an efficient algorithm exists as well as problems for which no efficient algorithm exists under mild complexity theoretic assumptions.