5 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.AI2020
Iterative beam search algorithms for the permutation flowshop
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin +1
We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branc…
cs.DM2019★ 5 cited
Tree search algorithms for the Sequential Ordering Problem
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard +1
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algor…
cs.DM2011★ 3 cited
The graphs with the max-Mader-flow-min-multiway-cut property
Guyslain Naves, Vincent Jost
We are given a graph , an independant set of \emph{terminals}, and a function . We want to know if the maximum -packing of v…