Worst-case demand distributions in vehicle routing
type: Item
instance of: scholarly article
title: Worst-case demand distributions in vehicle routing
zbMATH Open document ID: 1394.90080
author: John Gunnar Carlsson
author: Mehdi Behroozi
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6872220
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.03.047
OpenAlex ID: W2336422596
cites work: The robust vehicle routing problem with time windows
cites work: Power Diagrams: Properties, Algorithms and Applications
cites work: An adaptive evolutionary approach for real-time vehicle routing and dispatching
cites work: Q5729634
cites work: Robust convex optimization
cites work: Data-driven robust optimization
cites work: Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
cites work: Distribution Strategies that Minimize Transportation and Inventory Costs
cites work: On distributionally robust chance-constrained linear programs
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Robust partitioning for stochastic multivehicle routing
cites work: Modeling Distribution Problems with Time Windows: Part I
cites work: Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
cites work: The truck dispatching problem
cites work: The shortest path and the shortest road through n points
cites work: Planning and approximation models for delivery route based services with price-sensitive demands
cites work: Quantizers ad the worst case Euclidean traveling salesman problem
cites work: The robust capacitated vehicle routing problem under demand uncertainty
cites work: Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Q3824076
cites work: How Long Can a Euclidean Traveling Salesman Tour Be?
cites work: Convex Programming and Duality in Normed Space
cites work: A continuous approach to the design of physical distribution systems
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
cites work: Limit theorems and rates of convergence for Euclidean functionals
cites work: Stirling's Approximation for n!: The Ultimate Short Proof?
cites work: Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
cites work: Q5691080
cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability
DOI: 10.1016/J.EJOR.2016.03.047
description: scientific article; zbMATH DE number 6872220