Prize-collecting TSP with a budget constraint (Q5111751)
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: Prize-collecting TSP with a budget constraint |
scientific article; zbMATH DE number 7205040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prize-collecting TSP with a budget constraint |
scientific article; zbMATH DE number 7205040 |
Statements
27 May 2020
0 references
approximation algorithms
0 references
traveling salesman problem
0 references
Prize-Collecting TSP with a Budget Constraint (English)
0 references
0.9552171230316162
0 references
0.8443959355354309
0 references
0.8264052867889404
0 references
0.8049702644348145
0 references
