Jean-François Côté
Orcid: 0000-0002-6437-7638
According to our database1,
Jean-François Côté
authored at least 37 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
IEEE Des. Test, August, 2024
A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse.
Eur. J. Oper. Res., 2024
Eur. J. Oper. Res., 2024
2023
Math. Program., November, 2023
Eur. J. Oper. Res., 2023
2022
Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem.
INFORMS J. Comput., 2022
INFORMS J. Comput., 2022
Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates.
Int. J. Prod. Res., 2022
IEEE Des. Test, 2022
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022
2021
INFORMS J. Comput., 2021
Eur. J. Oper. Res., 2021
Proceedings of the IEEE International Test Conference in Asia, 2021
2020
Transp. Sci., 2020
Eur. J. Oper. Res., 2020
Streaming Scan Network (SSN): An Efficient Packetized Data Network for Testing of Complex SoCs.
Proceedings of the IEEE International Test Conference, 2020
Proceedings of the IEEE International Test Conference, 2020
2019
CoRR, 2019
2018
J. Oper. Res. Soc., 2018
INFORMS J. Comput., 2018
Implementing Design-for-Test Within a Tile-Based Design Methodology - Challenges and Solutions.
Proceedings of the IEEE International Test Conference in Asia, 2018
2017
2016
2015
Proceedings of the 2015 IEEE International Test Conference, 2015
A case study: Leverage IEEE 1687 based method to automate modeling, verification, and test access for embedded instruments in a server processor.
Proceedings of the 2015 IEEE International Test Conference, 2015
2014
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints.
Oper. Res., 2014
2012
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks.
Networks, 2012
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Networks, 2012
2011
An architectural model of trees to estimate forest structural attributes using terrestrial LiDAR.
Environ. Model. Softw., 2011
2009
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier.
Eur. J. Oper. Res., 2009
2008
Proceedings of the 2008 IEEE International Test Conference, 2008
2006
Proceedings of the 2006 IEEE International Test Conference, 2006
2004
Proceedings of the Proceedings 2004 International Test Conference (ITC 2004), 2004
1999
Proceedings of the Proceedings IEEE International Test Conference 1999, 1999