Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently solvable special cases of hard combinatorial optimization problems |
scientific article |
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
