Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3714900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3677509 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic analysis, linear programming and branch and bound / rank | |||
Normal rank | |||
Revision as of 14:31, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analyzing the Held-Karp TSP bound: A monotonicity property with application |
scientific article |
Statements
Analyzing the Held-Karp TSP bound: A monotonicity property with application (English)
0 references
1990
0 references
lower bounds
0 references
approximation algorithms
0 references
performance guarantees
0 references
traveling salesman problem
0 references
0 references
