The greedy travelling salesman's problem (Q3865869): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230090406 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230090406 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003476672 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230090406 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:16, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The greedy travelling salesman's problem |
scientific article |
Statements
The greedy travelling salesman's problem (English)
0 references
1979
0 references
graph theory
0 references
greedy algorithm
0 references
non-negatively-weighted independent system
0 references
traveling salesman problem
0 references
Hamiltonian circuits
0 references
Hamiltonian paths
0 references
