5 citations · 9 across the 4 of their papers we have counts for
5 papers
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…
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…
On green routing and scheduling problem
Nora Touati, Vincent Jost
The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and…
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…
Precoloring co-Meyniel graphs
Vincent Jost, Benjamin Lévêque, Frédéric Maffray
The pre-coloring extension problem consists, given a graph and a subset of nodes to which some colors are already assigned, in finding a coloring of with the minimum number…