It is easy to Light Up in practice

Light Up is an NP-complete puzzle for which several heuristics have been proposed. In this work, we present an integer programming formulation of Light Up and show that the instances that have been tackled in the literature can be solved in fractions of a second in this formulation.

[1]  Shi-Jim Yen,et al.  A Simple and Rapid Lights-up Solver , 2010, 2010 International Conference on Technologies and Applications of Artificial Intelligence.

[2]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[3]  Marco César Goldbarg,et al.  Solving the light up with Ant Colony Optimization , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[4]  Esra Erdem,et al.  Comparing ASP and CP on Four Grid Puzzles , 2009, RCRA@AI*IA.

[5]  Sancho Salcedo-Sanz,et al.  On the performance of the LP-guided Hopfield network-genetic algorithm , 2009, Comput. Oper. Res..