Output-sensitive complexity of multiobjective combinatorial optimization

Bökler, Fritz and Ehrgott, Matthias and Morris, Christopher and Mutzel, Petra (2017) Output-sensitive complexity of multiobjective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 24 (1-2). pp. 25-36. ISSN 1057-9214

Preview

PDF (Accepted manuscript)
main.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.
Download (691kB)

Official URL: https://doi.org/10.1002/mcda.1603

Abstract

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.

Item Type:

Journal Article

Journal or Publication Title:

Journal of Multi-Criteria Decision Analysis

Additional Information:

This is the peer reviewed version of the following article Bökler F, Ehrgott M, Morris C, Mutzel P. Output-sensitive complexity of multiobjective combinatorial optimization. J Multi-Crit Decis Anal. 2017;24:25–36. https://doi.org/10.1002/mcda.1603 which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/mcda.1603/full This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch

Subjects:

Departments:

Lancaster University Management School > Management Science

ID Code:

83972

Deposited By:

ep_importer_pure

Deposited On:

13 Jan 2017 14:16

Refereed?: