Follow
Olivier Spanjaard
Olivier Spanjaard
Sorbonne Université, CNRS, LIP6
Verified email at lip6.fr - Homepage
Title
Cited by
Cited by
Year
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
1592008
Bounded single-peaked width and proportional representation
D Cornaz, L Galand, O Spanjaard
ECAI 2012, 270-275, 2012
812012
A decision-theoretic approach to robust optimization in multivalued graphs
P Perny, O Spanjaard, LX Storme
Annals of Operations Research 147, 317-341, 2006
742006
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
662005
Near admissible algorithms for multiobjective search
P Perny, O Spanjaard
ECAI 2008, 490-494, 2008
632008
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
612013
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
612010
Strategy-proof mechanisms for facility location games with many facilities
B Escoffier, L Gourves, N Kim Thang, F Pascual, O Spanjaard
Algorithmic Decision Theory: Second International Conference, ADT 2011 …, 2011
552011
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
492010
An axiomatic approach to robustness in search problems with multiple scenarios
P Perny, O Spanjaard
arXiv preprint arXiv:1212.2496, 2012
422012
Algebraic Markov decision processes
P Perny, O Spanjaard, P Weng
19th International Joint Conference on Artificial Intelligence, 1372-1377, 2005
422005
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
L Galand, O Spanjaard
Computers & Operations Research 39 (7), 1540-1554, 2012
382012
Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem
C Delort, O Spanjaard
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
352010
On preference-based search in state space graphs
P Perny, O Spanjaard
AAAI/IAAI, 751-756, 2002
332002
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
252010
Incremental elicitation of rank-dependent aggregation functions based on bayesian linear regression
N Bourdache, P Perny, O Spanjaard
IJCAI-19-Twenty-Eighth International Joint Conference on Artificial …, 2019
242019
Multi-objective branch and bound. Application to the bi-objective spanning tree problem
F Sourd, O Spanjaard, P Perny
7th international conference in multi-objective programming and goal programming, 2006
242006
OWA-Based Search in State Space Graphs with Multiple Cost Functions.
L Galand, O Spanjaard
FLAIRS, 86-91, 2007
212007
State space search for risk-averse agents
P Perny, O Spanjaard, LX Storme
Twentieth International Joint Conference on Artificial Intelligence, 2353-2358, 2007
202007
Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem
H Gilbert, T Portoleau, O Spanjaard
Theoretical Computer Science 904, 27-47, 2022
182022
The system can't perform the operation now. Try again later.
Articles 1–20