Computing sandpile configurations using integer linear programming
Combinatorics
2020-09-01 v1 Optimization and Control
Abstract
It is well known that recurrent sandpile configurations can be characterized as the optimal solution of certain optimization problems. In this article, we present two new integer linear programming models, one that computes recurrent configurations and other that computes the order of the configuration. Finally, by using duality of linear programming, we are able to compute the identity configuration for the cone of a regular graph.
Cite
@article{arxiv.2008.13672,
title = {Computing sandpile configurations using integer linear programming},
author = {Carlos A. Alfaro and Carlos E. Valencia and Marcos C. Vargas},
journal= {arXiv preprint arXiv:2008.13672},
year = {2020}
}
Comments
Sandpile group, recurrent configurations, integer linear programming