Precoloring co-Meyniel graphs - Vincent Jost; Benjamin Lévêque; Frédéric Maffray (CoRR, 2005)

Simultaneous optimization of classical objectives in JIT scheduling. - Vassilissa Lebacque; Vincent Jost; Nadia Brauner (Eur. J. Oper. Res., 2007)

Precoloring Extension of Co-Meyniel Graphs. - Vincent Jost; Benjamin Lévêque; Frédéric Maffray (Graphs Comb., 2007)

Clique partitioning of interval graphs with submodular costs on the cliques. - Dion Gijswijt; Vincent Jost; Maurice Queyranne (RAIRO Oper. Res., 2007)

Batch processing with interval graph compatibilities between tasks. - Gerd Finke; Vincent Jost; Maurice Queyranne; András Sebö (Discret. Appl. Math., 2008)

Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. - Nadia Brauner; Vincent Jost (Discret. Math., 2008)

A one-to-one correspondence between colorings and stable sets. - Denis Cornaz; Vincent Jost (Oper. Res. Lett., 2008)

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. - Nora Touati Moungla; Pietro Belotti; Vincent Jost; Leo Liberti (INOC, 2011)

The graphs with the max-Mader-flow-min-multiway-cut property - Guyslain Naves; Vincent Jost (CoRR, 2011)

Pricing techniques for self regulation in Vehicle Sharing Systems. - Ariel Waserhole; Vincent Jost; Nadia Brauner (Electron. Notes Discret. Math., 2013)

A 0-1 integer linear programming approach to schedule outages of nuclear power plants. - Vincent Jost; David Savourey (J. Sched., 2013)

Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman. - Thierry Benoist; Antoine Jeanjean; Vincent Jost (CPAIOR, 2014)

Pricing in vehicle sharing systems: optimization in queuing networks with product forms. - Ariel Waserhole; Vincent Jost (EURO J. Transp. Logist., 2016)

Arc Consistency via Linear Programming. - Grigori German; Olivier Briant; Hadrien Cambazard; Vincent Jost (CP, 2017)

Trains do not vanish: the ROADEF/EURO challenge 2014. - Christian Artigues; Eric Bourreau; Vincent Jost; Safia Kedad-Sidhoum; François Ramond (Ann. Oper. Res., 2018)

Tree search algorithms for the Sequential Ordering Problem. - Luc Libralesso; Abdel-Malik Bouhassoun; Hadrien Cambazard; Vincent Jost (CoRR, 2019)

Do balanced words have a short period? - Nadia Brauner; Yves Crama; Etienne Delaporte; Vincent Jost; Luc Libralesso (Theor. Comput. Sci., 2019)

Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints. - Guillaume Claus; Hadrien Cambazard; Vincent Jost (ECAI, 2020)

Tree Search for the Sequential Ordering Problem. - Luc Libralesso; Abdel-Malik Bouhassoun; Hadrien Cambazard; Vincent Jost (ECAI, 2020)

Iterative beam search algorithms for the permutation flowshop. - Luc Libralesso; Pablo Andres Focke; Aurélien Secardin; Vincent Jost (Eur. J. Oper. Res., 2022)

Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance. - Khadija Hadj Salem; Vincent Jost; Yann Kieffer; Luc Libralesso; Stéphane Mancini (Oper. Res., 2022)

Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. - Khadija Hadj Salem; Luc Libralesso; Vincent Jost; Florian Fontan; Frédéric Maffray (Ann. Oper. Res., 2024)