The following pages link to Boris Detienne (Q322966):
Displaying 14 items.
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- Optimizing power generation in the presence of micro-grids (Q724120) (← links)
- Cut generation for an employee timetabling problem (Q1042034) (← links)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
- An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
- Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem (Q2076890) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
- Erratum to: ``Scheduling jobs on parallel machines to minimize a regular step total cost function'' (Q2434255) (← links)
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
- Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs (Q6112748) (← links)
