This section includes a number of two-stage stochastic programming data sets in in SMPS format.
Min-cost network flow and min-cost flow augmenting path packages
This section includes a Java implementation of min-cost network flow and min-cost flow augmenting path algorithms. NetworkTest.java includes an example that shows how to use the library.
Network revenue management data sets
This section includes a number of network revenue management data sets together with the performances of different benchmark strategies on the problems.
Traveling salesman problem applet
This section includes a Java implementation of a simple branch-and-bound scheme to find the optimal solution to small traveling salesman problems. The original reference is Little, Murty, Sweeney and Karel, "An algorithm for the traveling salesman problem," Operations Research, 11, 1963.
If you use any of the material here, please include a reference to this webpage.