default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Jost
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Khadija Hadj Salem
, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray:
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. Ann. Oper. Res. 337(2): 715-730 (2024)- 2022
- [j13]Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost:
Iterative beam search algorithms for the permutation flowshop. Eur. J. Oper. Res. 301(1): 217-234 (2022) - [j12]Khadija Hadj Salem, Vincent Jost, Yann Kieffer, Luc Libralesso, Stéphane Mancini:
Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance. Oper. Res. 22(3): 1639-1673 (2022) - 2020
- [c5]Guillaume Claus, Hadrien Cambazard, Vincent Jost:
Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints. ECAI 2020: 323-330 - [c4]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree Search for the Sequential Ordering Problem. ECAI 2020: 459-465 - [i4]Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost:
Iterative beam search algorithms for the permutation flowshop. CoRR abs/2009.05800 (2020)
2010 – 2019
- 2019
- [j11]Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso:
Do balanced words have a short period? Theor. Comput. Sci. 793: 169-180 (2019) - [i3]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree search algorithms for the Sequential Ordering Problem. CoRR abs/1911.12427 (2019) - 2018
- [j10]Christian Artigues, Eric Bourreau, Vincent Jost, Safia Kedad-Sidhoum, François Ramond:
Trains do not vanish: the ROADEF/EURO challenge 2014. Ann. Oper. Res. 271(2): 1091-1105 (2018) - 2017
- [c3]Grigori German, Olivier Briant, Hadrien Cambazard, Vincent Jost:
Arc Consistency via Linear Programming. CP 2017: 114-128 - 2016
- [j9]Ariel Waserhole, Vincent Jost:
Pricing in vehicle sharing systems: optimization in queuing networks with product forms. EURO J. Transp. Logist. 5(3): 293-320 (2016) - 2014
- [c2]Thierry Benoist, Antoine Jeanjean, Vincent Jost:
Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman. CPAIOR 2014: 1-14 - 2013
- [j8]Ariel Waserhole, Vincent Jost, Nadia Brauner:
Pricing techniques for self regulation in Vehicle Sharing Systems. Electron. Notes Discret. Math. 41: 149-156 (2013) - [j7]Vincent Jost, David Savourey:
A 0-1 integer linear programming approach to schedule outages of nuclear power plants. J. Sched. 16(6): 551-566 (2013) - 2011
- [c1]Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti:
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. INOC 2011: 439-449 - [i2]Guyslain Naves, Vincent Jost:
The graphs with the max-Mader-flow-min-multiway-cut property. CoRR abs/1101.2061 (2011)
2000 – 2009
- 2008
- [j6]Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö:
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156(5): 556-568 (2008) - [j5]Nadia Brauner, Vincent Jost:
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. Discret. Math. 308(11): 2319-2324 (2008) - [j4]Denis Cornaz, Vincent Jost:
A one-to-one correspondence between colorings and stable sets. Oper. Res. Lett. 36(6): 673-676 (2008) - 2007
- [j3]Vassilissa Lebacque, Vincent Jost, Nadia Brauner:
Simultaneous optimization of classical objectives in JIT scheduling. Eur. J. Oper. Res. 182(1): 29-39 (2007) - [j2]Vincent Jost, Benjamin Lévêque, Frédéric Maffray:
Precoloring Extension of Co-Meyniel Graphs. Graphs Comb. 23(3): 291-301 (2007) - [j1]Dion Gijswijt, Vincent Jost, Maurice Queyranne:
Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO Oper. Res. 41(3): 275-287 (2007) - 2005
- [i1]Vincent Jost, Benjamin Lévêque, Frédéric Maffray:
Precoloring co-Meyniel graphs. CoRR abs/cs/0509004 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
