The following pages link to Olivier Spanjaard (Q646547):
Displaying 31 items.
- Computing rank dependent utility in graphical models for sequential decision problems (Q646548) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Bottleneck shortest paths on a partially ordered scale (Q1416100) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Non-classical preference models in combinatorial problems: models and algorithms for graphs. (Thesis) (Q1775294) (← links)
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem (Q2072062) (← links)
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q2109969) (← links)
- Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences (Q2146734) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
- A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case (Q2415359) (← links)
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
- Measuring nearly single-peakedness of an electorate: some new insights (Q2695423) (← links)
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem (Q2901028) (← links)
- (Q3081835) (← links)
- Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation (Q3095289) (← links)
- Strategy-Proof Mechanisms for Facility Location Games with Many Facilities (Q3095293) (← links)
- Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra (Q3297806) (← links)
- Reducing the Number of Queries in Interactive Value Iteration (Q3449527) (← links)
- (Q3457226) (← links)
- A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems (Q3556576) (← links)
- Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities (Q3645328) (← links)
- (Q4576253) (← links)
- Truthful Many-to-Many Assignment with Private Weights (Q4924651) (← links)
- A hybrid dynamic programming approach to the biobjective binary knapsack problem (Q5178734) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q6124439) (← links)
- A non-utilitarian discrete choice model for preference aggregation (Q6163916) (← links)
- Euclidean preferences in the plane under $\ell_1$, $\ell_2$ and $\ell_\infty$ norms (Q6390371) (← links)