A robust optimization approach to dispatching technicians under stochastic service times
type: Item
instance of: scholarly article
title: A robust optimization approach to dispatching technicians under stochastic service times
zbMATH Open document ID: 1280.90025
author: Sebastián Souyris
author: Cristián E. Cortés
author: Fernando Ordóñez
author: Andrés Weintraub
published in: Optimization Letters
publication date: 2013-11-01T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/128398
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6221913
zbMATH Keywords: VRP with time windows
zbMATH Keywords: \(k\)-repairmen problem
zbMATH Keywords: service time uncertainty
zbMATH Keywords: robust optimization
describes a project that uses: CPLEX
describes a project that uses: VRP
describes a project that uses: ROME
MaRDI profile type: Publication
OpenAlex ID: W1973089064
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A Soft Robust Model for Optimization Under Ambiguity
cites work: Robust Truss Topology Design via Semidefinite Programming
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: A Vehicle Routing Problem with Stochastic Demand
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
cites work: Integer Programming and Combinatorial Optimization
cites work: A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
cites work: Generalized Dynamic Programming for Stochastic Combinatorial Optimization
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
cites work: Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
cites work: Stochastic vehicle routing with modified savings algorithm
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Robust Optimization for Empty Repositioning Problems
cites work: Q4471355
cites work: Stochastic vehicle routing
cites work: Distributionally Robust Optimization and Its Tractable Approximations
cites work: Robust Portfolio Selection Problems
cites work: The balanced billing cycle vehicle routing problem
cites work: Q4532236
cites work: Q3787809
cites work: Q3799802
cites work: A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: The Vehicle Routing Problem with Stochastic Travel Times
cites work: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
cites work: Stochastic vehicle routing: A comprehensive approach
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: The vehicle routing problem
cites work: Vehicle-scheduling Problems with Uncertainty and Omitted Customers
DOI: 10.1007/S11590-012-0557-6
description: scientific article; zbMATH DE number 6221913