HITS: Hyperplanes intersection tabu search for maximum score estimation

A tabu search algorithm is proposed for the maximum score estimator computation, where the focus is on large sample size and large number of estimated parameters. This is a deterministic algorithm rather than a stochastic one. The tabu search is much faster than the Simulated Annealing, while providing solutions of about the same quality. The software is provided as a Fortran console program and a C++ Graphical User Interface application. It is demonstrated using an empirical study concerning labor force participation of married women. Comparison with Mixed Integer Programming is also provided.