Lucie Galand
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lucie Galand has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Olivier Spanjaard
1 shared publication- Olivier Spanjaard
Sorbonne Université, CNRS, LIP6
1 shared publication Patrice Perny
1 shared publication
Latest Publications
- Open Access
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
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. In the case where the weights of the OWA are strictly decreasing, we then propose a mixed integer programming formulation, and provide dedicated optimality conditions yielding an important reduction of the size of the program. Next, we present two bounds that can be used to prune subspaces of solutions either in a shaving phase or in a branch and bound procedure. The validity of these bounds does not depend on specific properties of the weights (apart from non-negativity). All these exact resolution algorithms are compared on the basis of numerical experiments, according to their respective validity scopes.
Open AccessExact algorithms for OWA-optimization in multiobjective spanning tree problems
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. In the case where the weights of the OWA are strictly decreasing, we then propose a mixed integer programming formulation, and provide dedicated optimality conditions yielding an important reduction of the size of the program. Next, we present two bounds that can be used to prune subspaces of solutions either in a shaving phase or in a branch and bound procedure. The validity of these bounds does not depend on specific properties of the weights (apart from non-negativity). All these exact resolution algorithms are compared on the basis of numerical experiments, according to their respective validity scopes.
- Open Access
- 21 October 2009
- Published by Springer Nature
- p. 355-365
A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems
- 21 October 2009
- Published by Springer Nature
- p. 355-365
Open AccessA Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems