default search action
Jean-François Côté
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Ousmane Ali, Jean-François Côté, Leandro C. Coelho:
A GRASP algorithm for the concrete delivery problem. Comput. Oper. Res. 172: 106818 (2024) - [j24]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): 35-49 (2024) - [j23]Jean-François Côté, Renata Mansini, Alice Raffaele:
Multi-period time window assignment for attended home delivery. Eur. J. Oper. Res. 316(1): 295-309 (2024) - [j22]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): 520-533 (2024) - 2023
- [j21]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): 148-163 (2023) - [j20]Robin Legault, Jean-François Côté, Bernard Gendron:
A novel reformulation for the single-sink fixed-charge transportation problem. Math. Program. 202(1): 169-198 (2023) - 2022
- [j19]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): 17-25 (2022) - [j18]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): 6104-6123 (2022) - [j17]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): 1048-1069 (2022) - [j16]Olivier Lalonde, Jean-François Côté, Bernard Gendron:
A Branch-and-Price Algorithm for the Multiple Knapsack Problem. INFORMS J. Comput. 34(6): 3134-3150 (2022) - [c11]John Martinovic, Nico Strasdat, Jean-François Côté, Vinícius Loti de Lima:
A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem. OR 2022: 131-138 - 2021
- [j15]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): 162-177 (2021) - [j14]Jean-François Côté, Mohamed Haouari, Manuel Iori:
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem. INFORMS J. Comput. 33(3): 963-978 (2021) - [c10]Yu Huang, Haitao Fu, Bin Deng, Edward Seng, Marc Hutner, Jean-Francois Cote, Geir Eide:
The Advancement of 1149.10. ITC-Asia 2021: 1 - 2020
- [j13]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): 906-919 (2020) - [j12]Jean-François Côté, Michel Gendreau, Jean-Yves Potvin:
The Vehicle Routing Problem with Stochastic Two-Dimensional Items. Transp. Sci. 54(2): 453-469 (2020) - [c9]Manu Baby, Bernd Büttner, Piet Engelke, Ulrike Pfannkuchen, Reinhard Meier, Jonathan Gaudet, Jean-François Côté, Givargis Danialy, Martin Keim, Lori Schramm:
IJTAG Through a Two-Pin Chip Interface. ITC 2020: 1-5 - [c8]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: 1-10
2010 – 2019
- 2019
- [i1]Jean-François Côté, Mohamed Haouari, Manuel Iori:
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem. CoRR abs/1909.06835 (2019) - 2018
- [j11]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): 353-362 (2018) - [j10]Jean-François Côté, Manuel Iori:
The Meet-in-the-Middle Principle for Cutting and Packing Problems. INFORMS J. Comput. 30(4): 646-661 (2018) - [j9]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): 1242-1253 (2018) - [c7]Venkat Yellapragada, Suresh Raman, Banadappa Shivaray, Luc Romain, Benoit Nadeau-Dostie, Martin Keim, Jean-Francois Cote, Albert Au, Giri Podichetty, Ashok Anbalan:
Implementing Design-for-Test Within a Tile-Based Design Methodology - Challenges and Solutions. ITC-Asia 2018: 43-48 - 2017
- [j8]Jean-François Côté, Gianfranco Guastaroba, Maria Grazia Speranza:
The value of integrating loading and routing. Eur. J. Oper. Res. 257(1): 89-105 (2017) - 2016
- [j7]Stephen K. Sunter, Jean-Francois Cote, Jeff Rearick:
Streaming Access to ADCs and DACs for Mixed-Signal ATPG. IEEE Des. Test 33(6): 38-45 (2016) - 2015
- [c6]Tassanee Payakapan, Senwen Kan, Ken Pham, Kathy Yang, Jean-Francois Cote, Martin Keim, Jennifer Dworak:
A case study: Leverage IEEE 1687 based method to automate modeling, verification, and test access for embedded instruments in a server processor. ITC 2015: 1-10 - [c5]Stephen K. Sunter, Jean-Francois Cote, Jeff Rearick:
Streaming fast access to ADCs and DACs for mixed-signal ATPG. ITC 2015: 1-8 - 2014
- [j6]Jean-François Côté, Mauro Dell'Amico, Manuel Iori:
Combinatorial Benders' Cuts for the Strip Packing Problem. Oper. Res. 62(3): 643-661 (2014) - [j5]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): 1126-1141 (2014) - 2012
- [j4]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): 19-30 (2012) - [j3]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): 212-226 (2012) - 2011
- [j2]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): 761-777 (2011)
2000 – 2009
- 2009
- [j1]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): 464-469 (2009) - 2008
- [c4]Benoit Nadeau-Dostie, Kiyoshi Takeshita, Jean-Francois Cote:
Power-Aware At-Speed Scan Test Methodology for Circuits with Synchronous Clocks. ITC 2008: 1-10 - 2006
- [c3]Ken Posse, Al Crouch, Jeff Rearick, Bill Eklow, Mike Laisne, Ben Bennetts, Jason Doege, Mike Ricchetti, Jean-Francois Cote:
IEEE P1687: Toward Standardized Access of Embedded Instrumentation. ITC 2006: 1-8 - 2004
- [c2]Stephen K. Sunter, Aubin Roy, Jean-Francois Cote:
An Automated, Complete, Structural Test Solution for SERDES. ITC 2004: 95-104
1990 – 1999
- 1999
- [c1]Benoit Nadeau-Dostie, Jean-Francois Cote, Harry Hulvershorn, Stephen Pateras:
An embedded technique for at-speed interconnect testing. ITC 1999: 431-438
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-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint