When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? (Q4842116): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q228771 / rank | |||
Property / author | |||
Property / author: Richard M. Karp / rank | |||
Property / author | |||
Property / author: Bruce A. Reed / rank | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57401573 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/s0097539792235384 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995289318 / rank | |||
Normal rank |
Latest revision as of 10:28, 30 July 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