The SCEAS System
Navigation Menu

Search the dblp DataBase


Olivier Spanjaard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patrice Perny, Olivier Spanjaard
    On Preference-Based Search in State Space Graphs. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:751-756 [Conf]
  2. Patrice Perny, Olivier Spanjaard, Paul Weng
    Algebraic Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1372-1377 [Conf]
  3. Patrice Perny, Olivier Spanjaard, Louis-Xavier Storme
    State Space Search for Risk-Averse Agents. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2353-2358 [Conf]
  4. Patrice Perny, Olivier Spanjaard
    An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:469-476 [Conf]
  5. Jérôme Monnot, Olivier Spanjaard
    Bottleneck shortest paths on a partially ordered scale. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:3, pp:225-241 [Journal]
  6. Olivier Spanjaard
    Non-classical preference models in combinatorial problems: Models and algorithms for graphs. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:4, pp:325-328 [Journal]
  7. Patrice Perny, Olivier Spanjaard
    A preference-based approach to spanning trees and shortest paths problems****. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:3, pp:584-601 [Journal]
  8. Lucie Galand, Olivier Spanjaard
    OWA-Based Search in State Space Graphs with Multiple Cost Functions. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:86-91 [Conf]

  9. Rank-Dependent Probability Weighting in Sequential Decision Problems under Uncertainty. [Citation Graph (, )][DBLP]

  10. Near Admissible Algorithms for Multiobjective Search. [Citation Graph (, )][DBLP]

  11. Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. [Citation Graph (, )][DBLP]

  12. Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem. [Citation Graph (, )][DBLP]

  13. Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002