Follow
Boris Detienne
Boris Detienne
Maitre de conférences, Université de Bordeaux, Equipe-projet INRIA RealOpt
Verified email at u-bordeaux.fr - Homepage
Title
Cited by
Cited by
Year
Cut generation for an employee timetabling problem
B Detienne, L Péridy, É Pinson, D Rivreau
European Journal of Operational Research 197 (3), 1178-1184, 2009
652009
HEURISTICS FOR THE MULTI-ITEM CAPACITATED LOT-SIZING PROBLEM WITH LOST SALES
N Absi, S Dauzere-Péres, B Detienne
MOSIM'10, 2010
602010
Scheduling jobs on parallel machines to minimize a regular step total cost function
B Detienne, S Dauzère-Pérès, C Yugma
Journal of Scheduling, 1-16, 2011
362011
Optimizing power generation in the presence of micro-grids
W Van Ackooij, J De Boeck, B Detienne, S Pan, M Poss
European journal of operational research 271 (2), 450-461, 2018
352018
A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
B Detienne
European Journal of Operational Research 235 (3), 540-552, 2014
312014
Decomposition-based approaches for a class of two-stage robust binary optimization problems
AN Arslan, B Detienne
INFORMS journal on computing 34 (2), 857-871, 2022
262022
An iterative dynamic programming approach for the temporal knapsack problem
F Clautiaux, B Detienne, G Guillot
European Journal of Operational Research 293 (2), 442-456, 2021
212021
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation
B Detienne, R Sadykov, S Tanaka
European Journal of Operational Research 252 (3), 750-760, 2016
202016
An exact approach for scheduling jobs with regular step cost functions on a single machine
B Detienne, S Dauzère-Pérès, C Yugma
Computers & operations research 39 (5), 1033-1043, 2012
122012
Unsupervised concept annotation using latent dirichlet allocation and segmental methods
N Camelin, B Detienne, S Huet, D Quadri, F Lefevre
EMNLP Workshop on Unsupervised Learning in NLP (UNSUP), 72-81, 2011
122011
Lagrangian domain reductions for the single machine earliness–tardiness problem with release dates
B Detienne, É Pinson, D Rivreau
European Journal of Operational Research 201 (1), 45-54, 2010
112010
Adjustable robust optimization with objective uncertainty
B Detienne, H Lefebvre, E Malaguti, M Monaci
European Journal of Operational Research 312 (1), 373-384, 2024
82024
A new lagrangian bound for the min-sum job-shop scheduling
S Tanaka, R Sadykov, B Detienne
International Symposium on Scheduling ISS'2015, 2015
72015
A column generation based heuristic for the dial-a-ride problem
N Rahmani, B Detienne, R Sadykov, F Vanderbeck
International Conference on Information Systems, Logistics and Supply Chain …, 2016
62016
Scheduling inspection operations subject to a fixed production schedule
B Detienne, S Dauzere-Péres, C Yugma
Proceedings of the 4th multidisciplinary international conference on …, 2009
62009
The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation
B Detienne, R Sadykov, S Tanaka
7th Multidisciplinary International Conference on Scheduling: Theory and …, 2015
52015
Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem
R Griset, P Bendotti, B Detienne, M Porcheron, H Şen, F Vanderbeck
European Journal of Operational Research 298 (3), 1067-1083, 2022
42022
Adaptive robust optimization with objective uncertainty
B Detienne, H Lefebvre, E Malaguti, M Monaci
42021
Robust coverage optimization approach in Wireless Sensor Networks
A Daoudi, B Detienne, R El Azouzi, I Benelallam, EH Bouyakhf
2017 International Conference on Wireless Networks and Mobile Communications …, 2017
42017
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
F Clautiaux, B Detienne, H Lefebvre
Journal of Scheduling 26 (2), 169-191, 2023
3*2023
The system can't perform the operation now. Try again later.
Articles 1–20