Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
type: Item
instance of: scholarly article
title: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
zbMATH Open document ID: 1375.90031
author: Roberto Baldacci
author: Alessandro Hill
author: Edna A. Hoshino
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6816188
zbMATH Keywords: dynamic programming
zbMATH Keywords: multi-depot ring star problem
zbMATH Keywords: lower bounds
describes a project that uses: VRP
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.025
OpenAlex ID: W2606632081
cites work: The ring tree facility location problem
cites work: An exact solution framework for a broad class of vehicle routing problems
cites work: Heuristic algorithms for the multi-depot ring-star problem
cites work: The Capacitated m-Ring-Star Problem
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: The vehicle routing-allocation problem: A unifying framework
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Optimal capacitated ring trees
cites work: A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating a cycle in a transportation or a telecommunications network
cites work: A heuristic procedure for the capacitated \(m\)-ring-star problem
cites work: An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
cites work: A column generation approach for a school bus routing problem with resource constraints
DOI: 10.1016/J.EJOR.2017.04.025
description: scientific article; zbMATH DE number 6816188