**lau_np_test**,
a FORTRAN90 code which
calls lau_np(), which
implements heuristic algorithms for certain "hard" problems,
by Hang Tong Lau.

The computer code and data files made available on this web page are distributed under the MIT license

lau_np, a FORTRAN90 code which implements heuristic algorithms for various NP-hard combinatorial problems, including the integer linear programming problem, the K-center problem, the K-median problem, the 0-1 knapsack problem, the multiple knapsack problem, the graph matching problem, the graph partitioning problem, the minimal Steiner tree problem, and the traveling salesman problem;

- lau_np_test.f90, a sample problem.
- lau_np_test.sh, runs all the tests.
- lau_np_test.txt, the output file.