Solving symmetric vehicle routing problems asymmetrically
type: Item
instance of: scholarly article
title: Solving symmetric vehicle routing problems asymmetrically
zbMATH Open document ID: 0497.90074
DOI: 10.1016/0377-2217(83)90160-1
author: P. H. van Leeuwen
author: A. Volgenant
published in: European Journal of Operational Research
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 3784662
zbMATH Keywords: vehicle routing
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: additional constraints
zbMATH Keywords: assignment relaxations
zbMATH Keywords: asymmetric transformed distance matrix
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: computational results
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: 0377-2217(83)90160-1
OpenAlex ID: W2059399761
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
description: scientific article; zbMATH DE number 3784662