default search action
Jean Bertrand Gauthier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Jean Bertrand Gauthier, Stefan Irnich:
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. Discret. Appl. Math. 346: 131-153 (2024) - 2023
- [j10]Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider:
In-depth analysis of granular local search for capacitated vehicle routing. Discret. Appl. Math. 329: 61-86 (2023) - 2022
- [j9]Jean Bertrand Gauthier, Jacques Desrosiers:
The minimum mean cycle-canceling algorithm for linear programs. Eur. J. Oper. Res. 298(1): 36-44 (2022)
2010 – 2019
- 2018
- [j8]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Vector Space Decomposition for Solving Large-Scale Linear Programs. Oper. Res. 66(5): 1376-1389 (2018) - 2017
- [j7]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
A strongly polynomial Contraction-Expansion algorithm for network flow problems. Comput. Oper. Res. 84: 16-32 (2017) - [j6]Hocine Bouarab, Guy Desaulniers, Jacques Desrosiers, Jean Bertrand Gauthier:
Linear fractional approximations for master problems in column generation. Oper. Res. Lett. 45(5): 503-507 (2017) - 2016
- [j5]Jean Bertrand Gauthier, Antoine Legrain:
Operating room management under uncertainty. Constraints An Int. J. 21(4): 577-596 (2016) - [j4]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Tools for primal degenerate linear programs: IPS, DCA, and PE. EURO J. Transp. Logist. 5(2): 161-204 (2016) - 2015
- [j3]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
About the minimum mean cycle-canceling algorithm. Discret. Appl. Math. 196: 115-134 (2015) - 2014
- [j2]Jacques Desrosiers, Jean Bertrand Gauthier, Marco E. Lübbecke:
Row-reduced column generation for degenerate master problems. Eur. J. Oper. Res. 236(2): 453-460 (2014) - [j1]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Decomposition theorems for linear programs. Oper. Res. Lett. 42(8): 553-557 (2014)
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-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint