activity
20182021
collaborators

5 papers

math.OC2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux +1

In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of…

math.OC2020

Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP

Adèle Pass-Lanneau, Pascale Bendotti, Luca Brunod-Indrigo

The concept of anchored solutions is proposed as a new robust optimization approach to the Resource-Constrained Project Scheduling Problem (RCPSP) under processing times uncertaint…

cs.GT2019

The Convergence of Iterative Delegations in Liquid Democracy in a Social Network

Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau

Liquid democracy is a collective decision making paradigm which lies between direct and representative democracy. One of its main features is that voters can delegate their votes i…

cs.AI2018

Iterative Delegations in Liquid Democracy with Restricted Preferences

Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau

In this paper, we study liquid democracy, a collective decision making paradigm which lies between direct and representative democracy. One main feature of liquid democracy is that…

cs.DM2018

Perfect graphs with polynomially computable kernels

Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the exist…