#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Denis Cornaz, Lucie Galand, Olivier Spanjaard
- ECAI
- 2012

This paper is devoted to the proportional representation (PR) problem when the preferences are clustered single-peaked. PR is a “multi-winner” election problem, that we study in Chamberlin and Courant’s scheme [6]. We define clustered single-peakedness as a form of single-peakedness with respect to clusters of candidates, i.e. subsets of candidates that are… (More)

- John W. T. Smith, Y-J Ko, +7 authors Lisa Strauss
- Journal of clinical oncology : official journal…
- 2004

4513 Background: CCI-779 is an mTOR kinase inhibitor with activity in renal cell carcinoma (RCC, Atkins et al. J Clin Oncol, in press). A preliminary report of this phase 1/2 study of CCI-779 and interferon-α (IFN) in patients (pts) with advanced RCC described the safety and antitumor effects of the combination (Dutcher et al. Proc ASCO 22:213, 2003). We… (More)

- Lucie Galand, Patrice Perny, Olivier Spanjaard
- MCDM
- 2008

This paper is devoted to the search for Choquet-optimal solutions in multicriteria combinatorial optimization with application to spanning tree problems and knapsack problems. After recalling basic notions concerning the use of Choquet integrals for preference aggregation, we present a condition (named preference for interior points) that characterizes… (More)

- Lucie Galand, Patrice Perny
- UAI
- 2007

Choquet expected utility (CEU) is one of the most sophisticated decision criteria used in decision theory under uncertainty. It provides a generalisation of expected utility enhancing both descriptive and prescriptive possibilities. In this paper, we investigate the use of CEU for path-planning under uncertainty with a special focus on robust solutions. We… (More)

- Lucie Galand, Olivier Spanjaard
- FLAIRS Conference
- 2007

This paper is devoted to the determination of wellbalanced solutions in search problems involving multiple cost functions. After indicating various contexts in which the ordered weighted averaging operator (with decreasing weights) is natural to express the preferences between solutions, we propose a search algorithm to determine the OWA-optimal solution.… (More)

- Lucie Galand, Patrice Perny, Olivier Spanjaard
- European Journal of Operational Research
- 2010

This paper is devoted to the search of Choquet-optimal solutions in finite graph problems with multiple objectives. The Choquet integral is one of the most sophisticated preference models used in decision theory for aggregating preferences on multiple objectives. We first present a condition on preferences (name hereafter preference for interior points)… (More)

- Denis Cornaz, Lucie Galand, Olivier Spanjaard
- IJCAI
- 2013

This paper is devoted to complexity results regarding specific measures of proximity to singlepeakedness and single-crossingness, called “singlepeaked width” [Cornaz et al., 2012] and “singlecrossing width”. Thanks to the use of the PQ-tree data structure [Booth and Lueker, 1976], we show that both problems are polynomial time solvable in the general case… (More)

- Lucie Galand, Patrice Perny
- ECAI
- 2006

The aim of this paper is to introduce and solve new search problems in multiobjective state space graphs. Although most of the studies concentrate on the determination of the entire set of Pareto optimal solution paths, the size of which can be, in worst case, exponential in the number of nodes, we consider here more specialized problems where the search is… (More)

- Lucie Galand, Olivier Spanjaard
- Computers & OR
- 2012

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. We then propose different mixed integer programming formulations, according… (More)

- Lucie Galand, Julien Lesca, Patrice Perny
- IJCAI
- 2013

Multiobjective Dynamic Programming (MODP) is a general problem solving method used to determine the set of Pareto-optimal solutions in optimization problems involving discrete decision variables and multiple objectives. It applies to combinatorial problems in which Pareto-optimality of a solution extends to all its sub-solutions (Bellman principle). In this… (More)