An exact algorithm for a vehicle-and-driver scheduling problem
type: Item
instance of: scholarly article
title: An exact algorithm for a vehicle-and-driver scheduling problem
zbMATH Open document ID: 1391.90254
author: Bencomo Domínguez-Martín
author: Inmaculada Rodríguez-Martín
author: Juan-José Salazar-González
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901388
zbMATH Keywords: task scheduling
zbMATH Keywords: branch-and-cut
zbMATH Keywords: multi-depot
zbMATH Keywords: vehicle routing
Wikidata QID: Q56524179
cites work: Cvrplib
cites work: A branch-and-cut algorithm for vehicle routing problems
cites work: Q3048611
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Models and algorithms for integration of vehicle and crew scheduling
cites work: Q3714900
cites work: Q3217886
cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Vehicle Routing
describes a project that uses: Cvrplib
describes a project that uses: Concorde
describes a project that uses: CVRPSP
describes a project that uses: VRP
describes a project that uses: CVRPSEP
MaRDI profile type: Publication
full work available at URL: j.cor.2016.12.022
OpenAlex ID: W2564179995
DOI: 10.1016/J.COR.2016.12.022
description: scientific article; zbMATH DE number 6901388