论文标题
使用整数线性编程计算沙珀配置
Computing sandpile configurations using integer linear programming
论文作者
论文摘要
众所周知，可以将复发的沙珀构型表征为某些优化问题的最佳解决方案。在本文中，我们提出了两个新的整数线性编程模型，该模型计算经常性配置和其他计算配置顺序。最后，通过使用线性编程的双重性，我们能够计算常规图的锥体的身份配置。
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.
