A heuristic for the multiple tour maximum collection problem (Q1317095): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3343723 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The prize collecting traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The orienteering problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3795496 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3693257 / rank | |||
Normal rank | |||
Latest revision as of 12:36, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the multiple tour maximum collection problem |
scientific article |
Statements
A heuristic for the multiple tour maximum collection problem (English)
0 references
24 March 1994
0 references
traveling salesman
0 references
routing
0 references
scheduling
0 references
multiple tour maximum collection problem
0 references
subset of weighted nodes
0 references
heuristic
0 references
