A heuristic for the multiple tour maximum collection problem
type: Item
instance of: scholarly article
title: A heuristic for the multiple tour maximum collection problem
zbMATH Open document ID: 0789.90081
DOI: 10.1016/0305-0548(94)90065-5
author: Steven E. Butt
author: Tom M. Cavalier
published in: Computers \& Operations Research
publication date: 1994-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 527463
zbMATH Keywords: traveling salesman
zbMATH Keywords: routing
zbMATH Keywords: scheduling
zbMATH Keywords: multiple tour maximum collection problem
zbMATH Keywords: subset of weighted nodes
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90065-5
OpenAlex ID: W1965603691
cites work: Q3343723
cites work: The prize collecting traveling salesman problem
cites work: The orienteering problem
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: An Optimal Algorithm for the Orienteering Tour Problem
cites work: Q3795496
cites work: Q3693257
description: scientific article; zbMATH DE number 527463