Skip to content
#

combinatorial-problems

Here are 7 public repositories matching this topic...

A collection of algorithms and methods for solving combinatorial optimization problems, including techniques for TSP, Knapsack, and other NP-hard problems using heuristics, metaheuristics, and exact methods

  • Updated Nov 24, 2024
  • Jupyter Notebook

AA Second Project - The objective of this project was to design and test a randomized algorithm to solve the combinatorial problem from the first assignment, which was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. This randomized algorithm was based on the Monte Carlo algorithms.

  • Updated Jan 23, 2023
  • TeX

All you need to know about your coding interview includes algorithms, data structure, oops, design patterns, recursion, graph theory, tree traversal, combinatorial problems.

  • Updated Jul 29, 2021
  • JavaScript

Improve this page

Add a description, image, and links to the combinatorial-problems topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the combinatorial-problems topic, visit your repo's landing page and select "manage topics."

Learn more