Doctor in Informatics since 2003, working with Combinatorial Optimization and Integer Programming. Professor at Universidade Federal Fluminense, Brazil.
Highlights
- Pro
Popular repositories Loading
-
SparseMaxFlowMinCut
SparseMaxFlowMinCut PublicA simplistic implementation of shortest augmenting path algorithm for the maximum flow/minimum s-t cut problem on sparse graphs.
Julia 4
-
KnapsackCuts
KnapsackCuts PublicJulia implementation of the Knapsack cut separation proposed in (Avella et al, 2010)
-
OddDegreeCutSep
OddDegreeCutSep PublicC implementation of an exact separation routine for the (lifted) odd degree cut set inequalities
C 1
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.