Fork of the Concorde TSP solver with an easier build procedure
-
Updated
Mar 17, 2024 - C
Fork of the Concorde TSP solver with an easier build procedure
VNS-SOLVER : implementation of the VNS meta-heuristic using the C programming language
Repository for the course Operations Research 2
SIMPLEX algorithm applied in c
Operational Research 2 - PROJECT
Algorithms for the Black and White Knapsack Problem.
TSP optimization, Operations Research 2 project, UniPD 2022/23
Master 1 student project on operations research " Location problem (FLP) " using meta heuristics and cplex's relaxation to solve problems
Max Edge Weighted Clique Problem with multiple choice contrants solved with semidefinite programming
Finds the BST optimal using a dynamic and a greedy algorithm. Analyze both trees and processing time of the solution (on Latex document).
Operations Research (OR) - Codes for Transportation Problem, Game Theory, etc.
Implementation of method "route first, cluster-second" for solving CVRP.
Simplex is a program that solves LP problems.
Add a description, image, and links to the operations-research topic page so that developers can more easily learn about it.
To associate your repository with the operations-research topic, visit your repo's landing page and select "manage topics."