An integer programming-based local search for the covering salesman problem (Q1761202)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An integer programming-based local search for the covering salesman problem |
scientific article; zbMATH DE number 6106614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An integer programming-based local search for the covering salesman problem |
scientific article; zbMATH DE number 6106614 |
Statements
An integer programming-based local search for the covering salesman problem (English)
0 references
15 November 2012
0 references
covering salesman problem
0 references
heuristics
0 references
integer linear programming
0 references
0 references
0 references
0.8304786086082458
0 references
0.8230165839195251
0 references
0.8164947032928467
0 references
0.7954481840133667
0 references
