Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (Q3564373): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast heuristics for large scale covering-location problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Covering Tour Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3447238 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tiling and routing heuristic for the screening of cytological samples / rank | |||
Normal rank | |||
Latest revision as of 21:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network |
scientific article |
Statements
Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (English)
0 references
2 June 2010
0 references
traveling salesman problem
0 references
close enough traveling salesman problem
0 references
radio frequency identification
0 references
meter reading
0 references
0 references
