Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search".
-
Updated
May 20, 2025 - C
#
combinatorial-optimization
Here are 11 public repositories matching this topic...
Graph Convolutional Branch and Bound solver for the Traveling Salesman Problem.
deep-neural-networks branch-and-bound combinatorial-optimization tsp-solver graph-convolutional-network traveling-salesman-problem
-
Updated
Jul 10, 2025 - C
Projekt P1 - Levering af pakker
astar astar-algorithm pathfinding tsp p1 pairing-heap aau travelling-salesman combinatorial-optimization travelling-salesman-problem rasperrypi aalborg-university aalborg held-karp
-
Updated
Jan 29, 2019 - C
Maximum Stable Set by k-Rank Separation
-
Updated
Jun 19, 2021 - C
Max Edge Weighted Clique Problem with multiple choice contrants solved with semidefinite programming
graph-algorithms operations-research semidefinite-programming tabu-search branch-and-bound combinatorial-optimization mathematical-programming
-
Updated
Jan 16, 2019 - C
Metaheuristics for finding good Low Autocorrelation Binary Sequences.
-
Updated
Feb 26, 2019 - C
Exploring using DNNs to cluster graph vertices as heuristics for the Concorde TSP solver
-
Updated
Mar 30, 2018 - C
This project provides an implementation of the Traveling Salesman Problem using Operations Research techniques in C.
heuristics tsp operations-research optimization-algorithms combinatorial-optimization traveling-salesman-problem exact-algorithms
-
Updated
Nov 4, 2025 - C
Optimal Assignment is a famous topic in Operational Research. This projects contains a C program implementing a command line app that finds the optimal assignment. Given a set of jobs and a set of candidates, we have to assign each candidate a job. Assigning a job to a candidate has a particular cost. The problem is to find the assignment that e…
assignment-problem optimization-methods optimization-algorithms combinatorial-optimization optimization-problem
-
Updated
Jul 31, 2021 - C
This repository is about calculating the combinatorial number n above k. In computer science it can be done in multiples ways and theres 12 ways implemented in tarea1.c
-
Updated
Sep 8, 2025 - C
Improve this page
Add a description, image, and links to the combinatorial-optimization topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the combinatorial-optimization topic, visit your repo's landing page and select "manage topics."