When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? (Q4842116): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q57401573, #quickstatements; #temporary_batch_1709550817224 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401573 / rank | |||
Normal rank | |||
Revision as of 14:07, 4 March 2024
scientific article; zbMATH DE number 779131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? |
scientific article; zbMATH DE number 779131 |
Statements
When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? (English)
0 references
18 March 1996
0 references
probabilistic analysis
0 references
assignment problem
0 references
asymmetric traveling salesman problem
0 references
