Cut generation for an employee timetabling problem. - Boris Detienne; Laurent Péridy; Eric Pinson; David Rivreau (Eur. J. Oper. Res., 2009)

Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates. - Boris Detienne; Eric Pinson; David Rivreau (Eur. J. Oper. Res., 2010)

Unsupervised Concept Annotation using Latent Dirichlet Allocation and Segmental Methods. - Nathalie Camelin; Boris Detienne; Stéphane Huet; Dominique Quadri; Fabrice Lefèvre (ULNLP@EMNLP, 2011)

Concept Discovery for Language Understanding in an Information-query Dialogue System. - Nathalie Camelin; Boris Detienne; Stéphane Huet; Dominique Quadri; Fabrice Lefèvre (KDIR, 2011)

Concept Discovery and Automatic Semantic Annotation for Language Understanding in an Information-Query Dialogue System Using Latent Dirichlet Allocation and Segmental Methods. - Nathalie Camelin; Boris Detienne; Stéphane Huet; Dominique Quadri; Fabrice Lefèvre (IC3K, 2011)

Scheduling jobs on parallel machines to minimize a regular step total cost function. - Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma (J. Sched., 2011)

Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function. - Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma (J. Sched., 2011)

An exact approach for scheduling jobs with regular step cost functions on a single machine. - Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma (Comput. Oper. Res., 2012)

Heuristics for the multi-item capacitated lot-sizing problem with lost sales. - Nabil Absi; Boris Detienne; Stéphane Dauzère-Pérès (Comput. Oper. Res., 2013)

A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. - Boris Detienne (Eur. J. Oper. Res., 2014)

The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. - Boris Detienne; Ruslan Sadykov; Shunji Tanaka (Eur. J. Oper. Res., 2016)

Robust coverage optimization approach in Wireless Sensor Networks. - Abderrazak Daoudi; Boris Detienne; Rachid El Azouzi; Imade Benelallam; El-Houssine Bouyakhf (WINCOM, 2017)

Optimizing power generation in the presence of micro-grids. - Wim van Ackooij; Jérôme De Boeck; Boris Detienne; Stefania Pan; Michael Poss (Eur. J. Oper. Res., 2018)

An iterative dynamic programming approach for the temporal knapsack problem. - François Clautiaux; Boris Detienne; Gaël Guillot (Eur. J. Oper. Res., 2021)

Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem. - Rodolphe Griset; Pascale Bendotti; Boris Detienne; Marc Porcheron; Halil Sen; François Vanderbeck (Eur. J. Oper. Res., 2022)

Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems. - Ayse N. Arslan; Boris Detienne (INFORMS J. Comput., 2022)

A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. - François Clautiaux; Boris Detienne; Henri Lefebvre (J. Sched., 2023)

The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs. - Xavier Blanchot; François Clautiaux; Boris Detienne; Aurélien Froger; Manuel Ruiz (Eur. J. Oper. Res., 2023)

Adjustable robust optimization with objective uncertainty. - Boris Detienne; Henri Lefebvre; Enrico Malaguti; Michele Monaci (Eur. J. Oper. Res., 2024)