Solving the close-enough arc routing problem (Q2811327): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:42, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the close-enough arc routing problem |
scientific article |
Statements
Solving the close-enough arc routing problem (English)
0 references
10 June 2016
0 references
close-enough arc routing problem
0 references
close-enough traveling salesman problem
0 references
automated meter Reading
0 references
radio frequency identification
0 references
branch-and-cut algorithm
0 references
