Implementation of Held-Karp lower bound for the TSP

Open
#347 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
backend

Research direction

Start by reviewing the linked OR-Tools one-tree lower-bound reference, the cited research paper, and Boost.Graph's existing MST interfaces. Determine the appropriate BGL API and scope for the Held-Karp lower bound; done means the feature is implemented with coverage for representative TSP graphs and its behavior is documented.

Written by the indexing model from the issue text.

Description

algorithm priority: low

The Held-Karp lower bound for the TSP is a good lower bound for the TSP and at a big picture, it attempts to approximate the TSP from below by trying to obtain trees where a large number of nodes have degree 2. It still continues to attract research interest in the OR community. See for e.g., https://ojmo.centre-mersenne.org/item/10.5802/ojmo.11.pdf a recent work on this.

Google OR-Tools seems to provide an interface for this. Please see https://developers.google.com/optimization/reference/graph/one_tree_lower_bound

It would be great if the BGL team considers implementing the same in its libraries. I use BGL for many MST algorithms and it is very efficient. The Held-Karp lower bound uses MST as a subproblem.

Thank you.

Dominant language
C++
Stars
395
Forks
239
Avg merge
18h 50m
Merged PRs (30d)
20

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from boostorg/graph

All issues in boostorg/graph

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.