On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on the prize collecting traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763416 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Validation of subgradient optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The selective travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Some Generalizations of the Travelling-Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 09:58, 27 May 2024
scientific article; zbMATH DE number 960872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem |
scientific article; zbMATH DE number 960872 |
Statements
On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (English)
0 references
6 January 1997
0 references
Lagrangean relaxation
0 references
profitable tour problem
0 references
prize-collecting
0 references
travelling salesman
0 references
lower bounds
0 references
asymmetric version
0 references
