Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.2019.1002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.2019.1002 / rank | |||
Normal rank | |||
Latest revision as of 16:00, 30 December 2024
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
