OpCoast has created an online demo area to show how various algorithms operate. The following content is available using the links above:
- Label Propagation
- The demonstrator provides the basic label propagation method, Barber and Clark’s LPAm method, and Liu and Murata’s LPAm+ method. This is a online Javascript demo.
- Agile
- A harmonic balance simulator for Windows and Linux. This is an installable desktop application.
- F# Tutorial
- A substantial tutorial on developing a branch and bound algorithm in F#. The multi-part tutorial begins with solving a special case of the 0-1 knapsack and proceeds to develop a functional-style, generalized routine that solves the 0-1 knapsack, MAX-SAT and the traveling salesman problems (TSP). The final code is structured such that problem specific functions are passed to the generalized branch and bound solver to allow expansion to other problem types as well.