Routing optimization with time windows under uncertainty
- 23 February 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 175 (1-2) , 263-305
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (71420107028)
This publication has 41 references indexed in Scilit:
- Improved branch-cut-and-price for capacitated vehicle routingMathematical Programming Computation, 2016
- Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approachEuropean Journal of Operational Research, 2014
- The robust vehicle routing problem with time windowsComputers & Operations Research, 2013
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraintsEuropean Journal of Operational Research, 2012
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows2012
- An exact solution framework for a broad class of vehicle routing problemsComputational Management Science, 2010
- Reformulation and Decomposition of Integer Programs2009
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cutMathematical Programming, 2001
- On sharpness of tchebycheff-type inequalitiesAnnals of the Institute of Statistical Mathematics, 1962