This article explores the abelian sandpile model, a cellular automaton, and introduces a method using integer linear programming to determine its stabilizability on arbitrary finite graphs. The focus is on understanding when the model can achieve stability without any toppling of cells.