combinatorial optimization
Traveling Salesman
The travelling salesman problem (TSP) asks the following question: Given a list of cities, what is the shortest possible route that visits each city exactly once and returns to the...
graphInteger Programming
This is an algorithm for integer programming (also known as integer linear programming) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop
JaCoPFordFulkersonMaxFlow
Ford-Fulkerson (BFS-based aka Edmonds-Karp) Computes a maximum flow given a weighted directed graph.
timdumolAssignmentBranchAndBound
This is an algorithm with uses the branch and bound method to solve the assignment problem .
thatguy2048Binary Integer Programming
This is an algorithm for binary integer programming (also known as 0-1 integer programming) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop
JaCoP