Jean-François Côté

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 20

Top Topics

Integer Programming

Packing Problem

Benders Decomposition

Top Venues

Eur. J. Oper. Res.

INFORMS J. Comput.

Publications

Lucas Parada, Robin Legault, Jean-François Côté, Michel Gendreau
A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse. Eur. J. Oper. Res. 318 (2) (2024)
Ousmane Ali, Jean-François Côté, Leandro C. Coelho
A GRASP algorithm for the concrete delivery problem. Comput. Oper. Res. 172 (2024)
Janusz Rajski, Vivek Chickermane, Jean-François Côté, Stephan Eggersglüß, Nilanjan Mukherjee, Jerzy Tyszer
The Future of Design for Test and Silicon Lifecycle Management. IEEE Des. Test 41 (4) (2024)
Jean-François Côté, Renata Mansini, Alice Raffaele
Multi-period time window assignment for attended home delivery. Eur. J. Oper. Res. 316 (1) (2024)
Robin Legault, Jean-François Côté, Bernard Gendron
A novel reformulation for the single-sink fixed-charge transportation problem. Math. Program. 202 (1) (2023)
Yantong Li, Jean-François Côté, Leandro C. Coelho, Chuang Zhang, Shuai Zhang
Order assignment and scheduling under processing and distribution time uncertainty. Eur. J. Oper. Res. 305 (1) (2023)
Yantong Li, Jean-François Côté, Leandro C. Coelho, Peng Wu
Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates. Int. J. Prod. Res. 60 (20) (2022)
Jean-François Côté, Jeff Fan, Sean Shen, Givargis Danialy, Marcin Lipinski, Michael Garbers, Wu Yang, Martin Keim, Andreas Glowatz, Joe Reynick, Ayush Patel, Joanna Michna
Affordable and Comprehensive Testing of 3-D Stacked Die Devices. IEEE Des. Test 39 (5) (2022)
Olivier Lalonde, Jean-François Côté, Bernard Gendron
A Branch-and-Price Algorithm for the Multiple Knapsack Problem. INFORMS J. Comput. 34 (6) (2022)
Yantong Li, Jean-François Côté, Leandro C. Coelho, Peng Wu
Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem. INFORMS J. Comput. 34 (2) (2022)
Ousmane Ali, Jean-François Côté, Leandro C. Coelho
Models and algorithms for the delivery and installation routing problem. Eur. J. Oper. Res. 291 (1) (2021)
Jean-François Côté, Mohamed Haouari, Manuel Iori
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem. INFORMS J. Comput. 33 (3) (2021)
Imadeddine Aziez, Jean-François Côté, Leandro C. Coelho
Exact algorithms for the multi-pickup and delivery problem with time windows. Eur. J. Oper. Res. 284 (3) (2020)
Jean-François Côté, Mark Kassab, Wojciech Janiszewski, Ricardo Rodrigues, Reinhard Meier, Bartosz Kaczmarek, Peter Orlando, Geir Eide, Janusz Rajski, Glenn Colón-Bonet, Naveen Mysore, Ya Yin, Pankaj Pant
Streaming Scan Network (SSN): An Efficient Packetized Data Network for Testing of Complex SoCs. ITC (2020)
Jean-François Côté, Michel Gendreau, Jean-Yves Potvin
The Vehicle Routing Problem with Stochastic Two-Dimensional Items. Transp. Sci. 54 (2) (2020)
Jean-François Côté, Mohamed Haouari, Manuel Iori
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem. CoRR (2019)
Jean-François Côté, Manuel Iori
The Meet-in-the-Middle Principle for Cutting and Packing Problems. INFORMS J. Comput. 30 (4) (2018)
Thomas Chabot, Leandro C. Coelho, Jacques Renaud, Jean-François Côté
Mathematical model, heuristics and exact method for order picking in narrow aisles. J. Oper. Res. Soc. 69 (8) (2018)
Salma Naccache, Jean-François Côté, Leandro C. Coelho
The multi-pickup and delivery problem with time windows. Eur. J. Oper. Res. 269 (1) (2018)
Jean-François Côté, Gianfranco Guastaroba, Maria Grazia Speranza
The value of integrating loading and routing. Eur. J. Oper. Res. 257 (1) (2017)
Jean-François Côté, Mauro Dell'Amico, Manuel Iori
Combinatorial Benders' Cuts for the Strip Packing Problem. Oper. Res. 62 (3) (2014)
Jean-François Côté, Michel Gendreau, Jean-Yves Potvin
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints. Oper. Res. 62 (5) (2014)
Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60 (4) (2012)
Jean-François Côté, Michel Gendreau, Jean-Yves Potvin
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60 (1) (2012)
Jean-François Côté, Richard A. Fournier, Richard Egli
An architectural model of trees to estimate forest structural attributes using terrestrial LiDAR. Environ. Model. Softw. 26 (6) (2011)
Jean-François Côté, Jean-Yves Potvin
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. Eur. J. Oper. Res. 198 (2) (2009)