Walter Rei

Orcid: 0000-0001-6626-8251

According to our database1, Walter Rei authored at least 46 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Capacity planning with uncertainty on contract fulfillment.
Eur. J. Oper. Res., April, 2024

A vehicle routing problem with multiple service agreements.
Eur. J. Oper. Res., February, 2024

An asynchronous parallel benders decomposition method for stochastic network design problems.
Comput. Oper. Res., February, 2024

2023
An integrated learning and progressive hedging matheuristic for stochastic network design problem.
J. Heuristics, December, 2023

Problem-driven scenario clustering in stochastic optimization.
Comput. Manag. Sci., December, 2023

A two-stage stochastic post-disaster humanitarian supply chain network design problem.
Comput. Ind. Eng., September, 2023

2022
Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows.
Transp. Sci., 2022

Decision-based scenario clustering for decision-making under uncertainty.
Ann. Oper. Res., 2022

2021
Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design.
Transp. Sci., 2021

A Learning-Based Matheuristic for Stochastic Multicommodity Network Design.
INFORMS J. Comput., 2021

A reduced cost-based restriction and refinement matheuristic for stochastic network design problem.
J. Heuristics, 2021

Scheduled service network design with quality targets and stochastic travel times.
Eur. J. Oper. Res., 2021

Scheduled service network design with resource management for two-tier multimodal city logistics.
Eur. J. Oper. Res., 2021

Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning.
Comput. Oper. Res., 2021

2020
The Benders Dual Decomposition Method.
Oper. Res., 2020

2019
A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands.
Transp. Sci., 2019

A local branching matheuristic for the multi-vehicle routing problem with stochastic demands.
J. Heuristics, 2019

An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy.
Eur. J. Oper. Res., 2019

A hybrid recourse policy for the vehicle routing problem with stochastic demands.
EURO J. Transp. Logist., 2019

2018
Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems.
SIAM J. Optim., 2018

The vehicle routing problem with hard time windows and stochastic service times.
EURO J. Transp. Logist., 2018

A Study on Travel Time Stochasticity in Service Network Design with Quality Targets.
Proceedings of the Computational Logistics - 9th International Conference, 2018

2017
The Benders decomposition algorithm: A literature review.
Eur. J. Oper. Res., 2017

The Impact of Combining Inbound and Outbound Demand in City Logistics Systems.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

2016
50th Anniversary Invited Article - Future Research Directions in Stochastic Vehicle Routing.
Transp. Sci., 2016

Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning.
Transp. Sci., 2016

A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times.
Eur. J. Oper. Res., 2016

Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic.
Eur. J. Oper. Res., 2016

2015
Strategic analysis of the dairy transportation problem.
J. Oper. Res. Soc., 2015

Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing.
J. Heuristics, 2015

An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP.
Eur. J. Oper. Res., 2015

A column generation approach for a multi-attribute vehicle routing problem.
Eur. J. Oper. Res., 2015

Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm.
Comput. Oper. Res., 2015

A branch-and-price approach for a multi-period vehicle routing problem.
Comput. Oper. Res., 2015

2014
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands.
Discret. Appl. Math., 2014

Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands.
Comput. Oper. Res., 2014

Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design.
Comput. Oper. Res., 2014

Stochastic Vehicle Routing Problems.
Proceedings of the Vehicle Routing, 2014

2013
A path relinking algorithm for a multi-depot periodic vehicle routing problem.
J. Heuristics, 2013

2012
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.
Oper. Res., 2012

2011
Progressive hedging-based metaheuristics for stochastic network design.
Networks, 2011

Efficient lower bounds and heuristics for the variable cost and size bin packing problem.
Comput. Oper. Res., 2011

2010
A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands.
Transp. Sci., 2010

2009
Accelerating Benders Decomposition by Local Branching.
INFORMS J. Comput., 2009

Multi-thread integrative cooperative optimization for rich combinatorial problems.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

A concurrent evolutionary approach for rich combinatorial optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009


  Loading...