Browse Code
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and Variations using C# Generics
http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
Project Samples
License
Apache License V2.0Follow Path Partitioner
Other Useful Business Software
Next-Gen Encryption for Post-Quantum Security | CLEAR by Quantum Knight
CLEAR by Quantum Knight is a FIPS-140-3 validated encryption SDK engineered for enterprises requiring top-tier security. Offering robust post-quantum cryptography, CLEAR secures files, streaming media, databases, and networks with ease across over 30 modern platforms. Its compact design, smaller than a single smartphone image, ensures maximum efficiency and low energy consumption.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Path Partitioner!
