Shortest Path Problem

About the client

Benton, United States

Posted on Mar 10, 2017 / Est. budget $ 50 / Project closed

Awarded winner(s):


This problem entails optimizing a piece of Java code that currently achieves nearest neighbor results. The optimization will require that it improve upon this algorithm using perhaps some variation of Lin-Kernighan's algorithm (V-Opt method). The Java class files and project requirements will be furnished upon the award of the contract.

Project bids (1)

Bids are visible only by project owner and Premium members.