Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Catalog / lasaldan / tsp_cs312
Public GitHub Catalog Discovered Oct 6, 2026

lasaldan / tsp_cs312

An attempt at an efficient algorithm for solving the Traveling Salesman problem. Uses Branch and Bound with a heap-based priority queue. Has probing to periodically run a possible solution to a solution state. Occasionally performs well.

View repository on GitHub ↗ View creator profile Browse directory

About this discovery

Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.

#33390551GitHub System ID
lasaldanOrganization / User
PublicVisibility
ActiveCatalog Status

More from lasaldan

↗

lasaldan/js_calendar

Generates HTML to display a simple events calendar. Also includes a legend.

Discovered
↗

lasaldan/auto_js

auto_js is a ruby gem that fills the gap between the default rails management of javascript and a full front-end framework.

Discovered
FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.

SPONSORED Sponsored Partner