The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602)
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: The median tour and maximal covering tour problems: Formulations and heuristics |
scientific article; zbMATH DE number 611334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The median tour and maximal covering tour problems: Formulations and heuristics |
scientific article; zbMATH DE number 611334 |
Statements
The median tour and maximal covering tour problems: Formulations and heuristics (English)
0 references
19 February 1995
0 references
bicriterion routing problems
0 references
median tour problem
0 references
maximal covering tour problem
0 references
NP-hard
0 references
heuristic procedure
0 references
realistically scaled problem
0 references
distributed computer networks
0 references
0 references
0 references
0.7977895736694336
0 references
0.797671377658844
0 references
0.7861669063568115
0 references
0.7801120281219482
0 references
