1. Aldous, D., & Fill, J. A. (2002). Reversible Markov chains and random walks on graphs. Unfinished monograph, recompiled 2014. https://www.stat.berkeley.edu/users/aldous/RWG/book.pdf
2. AMPL Optimization Inc. (2017). AMPL Python API. https://amplpy.readthedocs.io/en/latest/index.html
3. Añez, J., De La Barra, T., & Pérez, B. (1996). Dual graph representation of transport networks. Transportation Research Part B: Methodological, 30(3), 209–216.
4. Bellman, R. E. (1957). Dynamic programming. Princeton University Press.
5. Berman, P., & Schnitger, G. (1992). On the complexity of approximating the independent set problem. Information and Computation, 96(1), 77–94.