Vincent Jost

Orcid: 0000-0002-6595-5030

According to our database1, Vincent Jost authored at least 22 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.
Ann. Oper. Res., June, 2024

2022
Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance.
Oper. Res., 2022

Iterative beam search algorithms for the permutation flowshop.
Eur. J. Oper. Res., 2022

2020
Tree Search for the Sequential Ordering Problem.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Do balanced words have a short period?
Theor. Comput. Sci., 2019

Tree search algorithms for the Sequential Ordering Problem.
CoRR, 2019

2018
Trains do not vanish: the ROADEF/EURO challenge 2014.
Ann. Oper. Res., 2018

2017
Arc Consistency via Linear Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Pricing in vehicle sharing systems: optimization in queuing networks with product forms.
EURO J. Transp. Logist., 2016

2014
Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
A 0-1 integer linear programming approach to schedule outages of nuclear power plants.
J. Sched., 2013

Pricing techniques for self regulation in Vehicle Sharing Systems.
Electron. Notes Discret. Math., 2013

2011
The graphs with the max-Mader-flow-min-multiway-cut property
CoRR, 2011

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2008
A one-to-one correspondence between colorings and stable sets.
Oper. Res. Lett., 2008

Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture.
Discret. Math., 2008

Batch processing with interval graph compatibilities between tasks.
Discret. Appl. Math., 2008

2007
Clique partitioning of interval graphs with submodular costs on the cliques.
RAIRO Oper. Res., 2007

Precoloring Extension of Co-Meyniel Graphs.
Graphs Comb., 2007

Simultaneous optimization of classical objectives in JIT scheduling.
Eur. J. Oper. Res., 2007

2005
Precoloring co-Meyniel graphs
CoRR, 2005


  Loading...