The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
type: Item
instance of: scholarly article
title: The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
zbMATH Open document ID: 1253.90161
author: Hu Qin
author: Wenbin Zhu
author: Andrew Lim
author: Zizhen Zhang
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6119359
zbMATH Keywords: branch and bound
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: toll-by-weight
describes a project that uses: Concorde
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.035
OpenAlex ID: W2075270503
cites work: Q3425132
cites work: A Faster, Better Approximation Algorithm for the Minimum Latency Problem
cites work: Approximation Schemes for Minimum Latency Problems
cites work: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
cites work: The traveling salesman problem with cumulative costs
cites work: The minimum latency problem
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: A new dominance procedure for combinatorial optimization problems
cites work: Solving the car sequencing problem via branch \& bound
cites work: A note on the traveling repairman problem
cites work: An improved approximation ratio for the minimum latency problem
cites work: Q5704408
cites work: The traveling salesman problem and its variations
cites work: On Representatives of Subsets
cites work: Q4039929
cites work: A new formulation for the traveling deliveryman problem
cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
cites work: The delivery man problem on a tree network
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The vehicle routing problem
cites work: Exact algorithms for the minimum latency problem
DOI: 10.1016/J.EJOR.2012.01.035
description: scientific article; zbMATH DE number 6119359