Exact algorithms for OWA-optimization in multiobjective spanning tree problems

doi:10.1016/j.cor.2011.09.003

Return

Exact algorithms for OWA-optimization in multiobjective spanning tree problems

2012-07-01

Lucie Galand *

Olivier Spanjaard

DOI：10.1016/j.cor.2011.09.003

Original

Save

View PDF

Abstract

En 中文

This paper deals with the multiobjective version of the optimal spanning tree problem. More precisely, we are interested in determining the optimal spanning tree according to an Ordered Weighted Average (OWA) of its objective values. We first show that the problem is weakly NP-hard. We then propose different mixed integer programming formulations, according to different subclasses of OWA functions. Furthermore, we provide various preprocessing procedures, the validity scopes of which depend again on the considered subclass of OWA functions. For designing such procedures, we propose generalized optimality conditions and efficiently computable bounds. These procedures enable to reduce the size of the instances before launching an off-the-shelf software for solving the mixed integer program. Their impact on the resolution time is evaluated on the basis of numerical experiments. (C) 2011 Elsevier Ltd. All rights reserved.

Keywords:

Multiobjective spanning tree problem

Ordered weighted average

MIP formulation

Optimality conditions

Bounding procedure

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.