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

Project Activity

See All Activity >

License

Apache License V2.0

Follow Path Partitioner

Path Partitioner Web Site

Other Useful Business Software
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Try Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Path Partitioner!

Additional Project Details

Operating Systems

Windows

Intended Audience

Science/Research

User Interface

.NET/Mono

Programming Language

C#

Related Categories

C# Algorithms, C# Mathematics Software, C# Research Software

Registered

2012-12-07