A COMBINATORIAL OPTIMIZATION PROBLEM IN SQL
Luis Eduardo Acosta Muñoz, F. Javier Moreno, Jaime Echeverri · International Conference on Information Systems, Technology and Management · 2010
In this paper, we analyze and solve a problem of combinatorial optimization using SQL. Traditionally this kind of problems are treated with efficient techniques in research operations area, such as linear programming, taboo search, neural networks, and genetic algorithms. We do not pretend to compete in performance with these techniques, our goal is to show how this kind of problems can be solved using a language like SQL, a language belonging to the database area. In this way, we can establish a link between these two areas. Moreover, we take advantage of SQL features rarely used like Common Table Expression clause. This clause can be used to simplify some SQL queries.