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 |
|---|---|---|---|
| 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
