For a description of the software, please read

   Joao P. Pedroso. Tabu search for mixed integer programming. In
   Cesar Rego, editor, Metaheuristic Optimization via Memory and
   Evolution: Tabu Search and Scatter Search. Springer, 2005.

Compilation:
============
Typing 'make' at the directory where the sources are should be enough,
on machines with gcc and GLPK installed:
$ make
gcc -O3 -Wall -DNDEBUG -Wall tabusearch.c mip.o -o tabusearch -lglpk -lm
$ 
 
Usage:
======
After compiling, at the shell call:
$ ./tabusearch seed niter len filename [filename.dat]
where:
  seed -> initializer for random number generation (0 -> system default's seed)
  niter -> number of tabu search iterations 
  len -> tabu tenure (0 for a random number in [1..nintegers]
  filename -> name of the instance file:
       *.mps -> mps format
       *.mod -> ampl/gnu mathprog model)
                (=> filename.dat -> NULL, or corresponting data)
       *.lp -> cplex lp format

Examples:
=========
$ ./tabusearch 1 1000 0 gap.mod
$ ./tabusearch 1 1000 0 sudoku.mod sudoku.dat
$ ./tabusearch 1 1000 1 mod008.mps