Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
type: Item
instance of: scholarly article
title: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
zbMATH Open document ID: 1251.90061
author: Jorge Riera-Ledesma
author: Juan-José Salazar-González
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6107473
zbMATH Keywords: school bus routing
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: branch-and-cut
zbMATH Keywords: mathematical modeling
MaRDI profile type: Publication
full work available at URL: j.cor.2011.04.015
OpenAlex ID: W2031528042
cites work: The school bus routing problem: a review
cites work: Travelling purchaser problem
cites work: The Capacitated m-Ring-Star Problem
cites work: The vehicle routing-allocation problem: A unifying framework
cites work: Q4198056
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Solving the asymmetric traveling purchaser problem
cites work: Applications of linear programming in the oil industry
cites work: A result on projection for the vehicle routing problem
cites work: The prize collecting traveling salesman problem: II. Polyhedral results
cites work: Q4461916
cites work: Q3714900
cites work: Parallel branch, cut, and price for large-scale discrete optimization
DOI: 10.1016/J.COR.2011.04.015
description: scientific article; zbMATH DE number 6107473