New optimality cuts for a single-vehicle stochastic routing problem
type: Item
instance of: scholarly article
title: New optimality cuts for a single-vehicle stochastic routing problem
zbMATH Open document ID: 0922.90058
DOI: 10.1023/A:1018995927636
author: K. Appert
published in: Annals of Operations Research
publication date: 1999-06-10T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1299365
zbMATH Keywords: route failure
zbMATH Keywords: single-vehicle problem
zbMATH Keywords: integer \(L\)-shaped method
zbMATH Keywords: optimality cuts
MaRDI profile type: Publication
full work available at URL: a:1018995927636
OpenAlex ID: W164659486
Recommended article: The stochastic vehicle routing problem revisited
Recommended article: Q4887144
Recommended article: Stochastic optimization models for a single-sink transportation problem
Recommended article: A new approach to partial constraint satisfaction problems
Recommended article: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
Recommended article: Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
Recommended article: The Vehicle Routing Problem with Stochastic Travel Times
Recommended article: AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS
description: scientific article; zbMATH DE number 1299365