Conceptadvanced
Held-Karp lower bound
Also called 1-tree bound, Held-Karp relaxation bound.
Lower bound on TSP from 1-trees with Lagrangian penalties on vertex degrees.
Lower bound on TSP from 1-trees with Lagrangian penalties on vertex degrees.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 3WD93E Edit this page History Report an error