Complexity and approximation for traveling salesman problems with profits (Q2441781): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.02.046 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.02.046 / rank | |||
Normal rank | |||
Latest revision as of 16:01, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation for traveling salesman problems with profits |
scientific article |
Statements
Complexity and approximation for traveling salesman problems with profits (English)
0 references
28 March 2014
0 references
routing problem with profit
0 references
computational complexity
0 references
approximation algorithm
0 references
path
0 references
tree
0 references
cycle
0 references
0 references
