Lower bounds for parallel machines scheduling. - David Savourey; Philippe Baptiste; Antoine Jouglet (RIVF, 2006)

Ordonnancement sur machines parallèles: minimiser la somme des coûts. (Parallel Machines scheduling problem with minsum criteria). - David Savourey (2006)

Dominance-based heuristics for one-machine total cost scheduling problems. - Antoine Jouglet; David Savourey; Jacques Carlier; Philippe Baptiste (Eur. J. Oper. Res., 2008)

The Reformulation-Optimization Software Engine. - Leo Liberti; Sonia Cafieri; David Savourey (ICMS, 2010)

Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. - Antoine Jouglet; David Savourey (Comput. Oper. Res., 2011)

The Anonymous Subgraph Problem. - Andrea Bettinelli; Leo Liberti; Franco Raimondi; David Savourey (Comput. Oper. Res., 2013)

A 0-1 integer linear programming approach to schedule outages of nuclear power plants. - Vincent Jost; David Savourey (J. Sched., 2013)

On the Enumeration of Non-dominated Spanning Trees with Imprecise Weights. - Tom Davot; Sébastien Destercke; David Savourey (ECSQARU, 2023)

On the enumeration of non-dominated matroids with imprecise weights. - Tom Davot; Tuan-Anh Vu; Sébastien Destercke; David Savourey (Int. J. Approx. Reason., 2024)