Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1053952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently solvable special cases of hard combinatorial optimization problems |
scientific article; zbMATH DE number 1053952 |
Statements
Efficiently solvable special cases of hard combinatorial optimization problems (English)
0 references
28 August 1997
0 references
survey
0 references
polynomially solvable special cases
0 references
travelling salesman
0 references
quadratic assignment
0 references
Steiner tree
0 references
recognition algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8528316020965576
0 references
0.8156120181083679
0 references
0.7818465232849121
0 references
