Solving the close-enough arc routing problem (Q2811327): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21525 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047226187 / rank | |||
Normal rank | |||
Revision as of 19:09, 19 March 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
