Olivier Spanjaard
Olivier Spanjaard
Sorbonne Université, CNRS, LIP6
Verified email at lip6.fr - Homepage
Cited by
Cited by
A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem
F Sourd, O Spanjaard
INFORMS Journal on Computing 20 (3), 472-484, 2008
A decision-theoretic approach to robust optimization in multivalued graphs
P Perny, O Spanjaard, LX Storme
Annals of Operations Research 147 (1), 317-341, 2006
Bounded Single-Peaked Width and Proportional Representation.
D Cornaz, L Galand, O Spanjaard
ECAI 12, 270-275, 2012
A preference-based approach to spanning trees and shortest paths problems
P Perny, O Spanjaard
European Journal of Operational Research 162 (3), 584-601, 2005
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
L Galand, P Perny, O Spanjaard
European Journal of Operational Research 204 (2), 303-315, 2010
Kemeny elections with bounded single-peaked or single-crossing width
D Cornaz, L Galand, O Spanjaard
23rd International Joint Conference on Artificial Intelligence (IJCAI 2013 …, 2013
Near admissible algorithms for multiobjective search
P Perny, O Spanjaard
A branch and bound algorithm for Choquet optimization in multicriteria problems
L Galand, P Perny, O Spanjaard
Multiple criteria decision making for sustainable energy and transportation …, 2010
Strategy-proof mechanisms for facility location games with many facilities
B Escoffier, L Gourves, NK Thang, F Pascual, O Spanjaard
International conference on algorithmic decisiontheory, 67-81, 2011
An axiomatic approach to robustness in search problems with multiple scenarios
P Perny, O Spanjaard
arXiv preprint arXiv:1212.2496, 2012
Algebraic Markov decision processes
P Perny, O Spanjaard, P Weng
On preference-based search in state space graphs
P Perny, O Spanjaard
AAAI/IAAI, 751-756, 2002
Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem
C Delort, O Spanjaard
International Symposium on Experimental Algorithms, 253-265, 2010
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
L Galand, O Spanjaard
Computers & Operations Research 39 (7), 1540-1554, 2012
Multi-objective branch and bound. Application to the bi-objective spanning tree problem
F Sourd, O Spanjaard, P Perny
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
B Escoffier, L Gourvès, J Monnot, O Spanjaard
European Journal of Operational Research 205 (1), 19-30, 2010
OWA-Based Search in State Space Graphs with Multiple Cost Functions.
L Galand, O Spanjaard
FLAIRS conference, 86-91, 2007
State Space Search for Risk-Averse Agents.
P Perny, O Spanjaard, LX Storme
IJCAI, 2353-2358, 2007
Exploitation de préférences non-classiques dans les problèmes combinatoires: modèles et algorithmes pour les graphes
O Spanjaard
Paris 9, 2003
Reducing the number of queries in interactive value iteration
H Gilbert, O Spanjaard, P Viappiani, P Weng
International Conference on Algorithmic DecisionTheory, 139-152, 2015
The system can't perform the operation now. Try again later.
Articles 1–20