Computing sandpile configurations using integer linear programming
Carlos A. Alfaro, Carlos E. Valencia, Marcos C. Vargas
TL;DR
This paper introduces two new integer linear programming models to compute recurrent sandpile configurations and their order, and uses LP duality to find the identity configuration for regular graphs.
Contribution
It presents novel ILP models for computing sandpile configurations and their order, and applies LP duality to determine the identity configuration in regular graphs.
Findings
New ILP models for recurrent configurations and order
Method to compute identity configuration using LP duality
Applicable to regular graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetroleum Processing and Analysis · Enhanced Oil Recovery Techniques · Hydrocarbon exploration and reservoir analysis