An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices (Q2253558)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6321985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices |
scientific article; zbMATH DE number 6321985 |
Statements
An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices (English)
0 references
27 July 2014
0 references
covering tour
0 references
two-commodity flow model
0 references
branch-and-cut
0 references
metaheuristic
0 references
0.88569176197052
0 references
0.8748041987419128
0 references
0.855383574962616
0 references
0.8389989733695984
0 references
0.8378554582595825
0 references
