Data structures and network algorithms
Data structures and network algorithms
Minimization methods for non-differentiable functions
Minimization methods for non-differentiable functions
On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
On bicriterion minimal spanning trees: an approximation
Computers and Operations Research
Min-max optimization of several classical discrete optimization problems
Journal of Optimization Theory and Applications
An Implementation of Shor's r-Algorithm
Computational Optimization and Applications
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Optimization
Exact procedures for solving the discrete ordered median problem
Computers and Operations Research
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
A flexible model and efficient solution strategies for discrete location problems
Discrete Applied Mathematics
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
INFORMS Journal on Computing
On efficient WOWA optimization for decision support under risk
International Journal of Approximate Reasoning
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Characterization of the ordered weighted averaging operators
IEEE Transactions on Fuzzy Systems
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
| Hi-index | 0.01 |
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.