Online covering salesman problem (Q1743496)
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: Online covering salesman problem |
scientific article; zbMATH DE number 6859597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online covering salesman problem |
scientific article; zbMATH DE number 6859597 |
Statements
Online covering salesman problem (English)
0 references
13 April 2018
0 references
covering salesman problem
0 references
realtime blockage
0 references
competitive analysis
0 references
service cost
0 references
0.8361291885375977
0 references
0.8231359720230103
0 references
0.8168350458145142
0 references
0.8150457739830017
0 references
0.7953048944473267
0 references
