soumads67 Goto Github PK

edollar

greedymax

Three Algorithms to solve MaxCut: an optimal solver via Integer Linear Programming with Gurobi, an approximative greedy solver and an approximative random greedy solver

intensecoin

IntenseCoin Base

interview-prep

Here is how to prepare for Data Structures / Algorithms for Coding Interviews. This is a comprehensive collection of problems across hot interview topics like Dynamic Programming, LinkedLists, Greedy, Arrays, Binary Trees, Trees, etc.

little-tsp

A C++ implementation of the branch and bound TSP algorithm described by Little et al in their 1963 paper

m2cdsi-sadmd

Metaheuristique pour la résolution du problème du sac à dos multidimensionnel avec contraintes de demande

metaheuristique-en-optimisation---p-median

optframe

OptFrame - Optimization Framework

optimisation-combinatoire

pert

PERT Implementation

sac-a-dos

sad

algo méta heuristique du sac a dos

simplexengine

Game engine with a custom made software renderer (OpenGL-like rendering pipeline)

simplexer

My own lexer implementation called "Simplexer"

tp_ioc

wkgcoin