Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579340 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053711501 / rank | |||
Normal rank | |||
Latest revision as of 11:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem |
scientific article |
Statements
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (English)
0 references
1983
0 references
perfect matching
0 references
2-matching
0 references
Hamiltonian cycle
0 references
hypomatchable
0 references
