Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847)
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: Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems |
scientific article; zbMATH DE number 7242695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems |
scientific article; zbMATH DE number 7242695 |
Statements
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (English)
0 references
1 September 2020
0 references
approximation algorithms
0 references
traveling salesman problem
0 references
constrained optimization
0 references
