When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? (Q4842116): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
Normal rank | |||
Revision as of 07:24, 16 February 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
