default search action
Walter Rei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Ragheb Rahmaniani, Teodor Gabriel Crainic
, Michel Gendreau, Walter Rei:
An asynchronous parallel benders decomposition method for stochastic network design problems. Comput. Oper. Res. 162: 106459 (2024) - [j40]Vincentius C. G. Karels
A vehicle routing problem with multiple service agreements. Eur. J. Oper. Res. 313(1): 129-145 (2024) - [j39]Teodor Gabriel Crainic
Capacity planning with uncertainty on contract fulfillment. Eur. J. Oper. Res. 314(1): 152-175 (2024) - 2023
- [j38]Mohammad Daneshvar
A two-stage stochastic post-disaster humanitarian supply chain network design problem. Comput. Ind. Eng. 183: 109459 (2023) - [j37]Julien Keutchayan, Janosch Ortmann
Problem-driven scenario clustering in stochastic optimization. Comput. Manag. Sci. 20(1): 13 (2023) - [j36]Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei:
An integrated learning and progressive hedging matheuristic for stochastic network design problem. J. Heuristics 29(4-6): 409-434 (2023) - 2022
- [j35]Mike Hewitt
Decision-based scenario clustering for decision-making under uncertainty. Ann. Oper. Res. 315(2): 747-771 (2022) - [j34]Fabian Torres
Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows. Transp. Sci. 56(3): 631-653 (2022) - 2021
- [j33]Teodor Gabriel Crainic
Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. Comput. Oper. Res. 132: 105308 (2021) - [j32]Giacomo Lanza
Scheduled service network design with quality targets and stochastic travel times. Eur. J. Oper. Res. 288(1): 30-46 (2021) - [j31]Pirmin Fontaine
Scheduled service network design with resource management for two-tier multimodal city logistics. Eur. J. Oper. Res. 294(2): 558-570 (2021) - [j30]Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei:
A reduced cost-based restriction and refinement matheuristic for stochastic network design problem. J. Heuristics 27(3): 325-351 (2021) - [j29]Fatemeh Sarayloo
A Learning-Based Matheuristic for Stochastic Multicommodity Network Design. INFORMS J. Comput. 33(2): 643-656 (2021) - [j28]Teodor Gabriel Crainic
Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design. Transp. Sci. 55(2): 414-435 (2021) - 2020
- [j27]Ragheb Rahmaniani
The Benders Dual Decomposition Method. Oper. Res. 68(3): 878-895 (2020)
2010 – 2019
- 2019
- [j26]Majid Salavati-Khoshghalb
A hybrid recourse policy for the vehicle routing problem with stochastic demands. EURO J. Transp. Logist. 8(3): 269-298 (2019) - [j25]Majid Salavati-Khoshghalb
An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy. Eur. J. Oper. Res. 273(1): 175-189 (2019) - [j24]Florent Hernández, Michel Gendreau, Ola Jabali
A local branching matheuristic for the multi-vehicle routing problem with stochastic demands. J. Heuristics 25(2): 215-245 (2019) - [j23]Majid Salavati-Khoshghalb
A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 53(5): 1334-1353 (2019) - 2018
- [j22]Fausto Errico, Guy Desaulniers, Michel Gendreau, Walter Rei, Louis-Martin Rousseau:
The vehicle routing problem with hard time windows and stochastic service times. EURO J. Transp. Logist. 7(3): 223-251 (2018) - [j21]Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei:
Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems. SIAM J. Optim. 28(1): 875-903 (2018) - [c4]Giacomo Lanza
A Study on Travel Time Stochasticity in Service Network Design with Quality Targets. ICCL 2018: 401-416 - 2017
- [j20]Ragheb Rahmaniani, Teodor Gabriel Crainic
The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3): 801-817 (2017) - [c3]Pirmin Fontaine
The Impact of Combining Inbound and Outbound Demand in City Logistics Systems. COMPSAC (2) 2017: 766-770 - 2016
- [j19]Fausto Errico, Guy Desaulniers
A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249(1): 55-66 (2016) - [j18]Teodor Gabriel Crainic
Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic. Eur. J. Oper. Res. 253(2): 404-417 (2016) - [j17]Teodor Gabriel Crainic, Fausto Errico, Walter Rei, Nicoletta Ricciardi:
Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning. Transp. Sci. 50(2): 559-578 (2016) - [j16]Michel Gendreau, Ola Jabali
50th Anniversary Invited Article - Future Research Directions in Stochastic Vehicle Routing. Transp. Sci. 50(4): 1163-1173 (2016) - 2015
- [j15]Alireza Rahimi-Vahed, Teodor Gabriel Crainic
Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput. Oper. Res. 53: 9-23 (2015) - [j14]Iman Dayarian
A branch-and-price approach for a multi-period vehicle routing problem. Comput. Oper. Res. 55: 167-184 (2015) - [j13]Iman Dayarian
A column generation approach for a multi-attribute vehicle routing problem. Eur. J. Oper. Res. 241(3): 888-906 (2015) - [j12]Nadia Lahrichi, Teodor Gabriel Crainic
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP. Eur. J. Oper. Res. 246(2): 400-412 (2015) - [j11]Nizar El Hachemi, Teodor Gabriel Crainic
Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. J. Heuristics 21(5): 663-685 (2015) - [j10]Nadia Lahrichi, Teodor Gabriel Crainic
Strategic analysis of the dairy transportation problem. J. Oper. Res. Soc. 66(1): 44-56 (2015) - 2014
- [j9]Teodor Gabriel Crainic
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Comput. Oper. Res. 43: 90-99 (2014) - [j8]Lin Zhu
Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50: 1-13 (2014) - [j7]Ola Jabali
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discret. Appl. Math. 177: 121-136 (2014) - [p1]Michel Gendreau, Ola Jabali, Walter Rei:
Stochastic Vehicle Routing Problems. Vehicle Routing 2014: 213-239 - 2013
- [j6]Alireza Rahimi-Vahed, Teodor Gabriel Crainic
A path relinking algorithm for a multi-depot periodic vehicle routing problem. J. Heuristics 19(3): 497-524 (2013) - 2012
- [j5]Thibaut Vidal
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems. Oper. Res. 60(3): 611-624 (2012) - 2011
- [j4]Teodor Gabriel Crainic
Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11): 1474-1482 (2011) - [j3]Teodor Gabriel Crainic
Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2): 114-124 (2011) - 2010
- [j2]Walter Rei, Michel Gendreau, Patrick Soriano:
A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 44(1): 136-146 (2010)
2000 – 2009
- 2009
- [j1]Walter Rei, Jean-François Cordeau, Michel Gendreau, Patrick Soriano:
Accelerating Benders Decomposition by Local Branching. INFORMS J. Comput. 21(2): 333-345 (2009) - [c2]Teodor Gabriel Crainic, Gloria Cerasela Crisan, Michel Gendreau, Nadia Lahrichi, Walter Rei:
A concurrent evolutionary approach for rich combinatorial optimization. GECCO (Companion) 2009: 2017-2022 - [c1]Teodor Gabriel Crainic
Multi-thread integrative cooperative optimization for rich combinatorial problems. IPDPS 2009: 1-8
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 20:31 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: