1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall Inc., Englewood Cliffs (1993). (Theory, algorithms, and applications)
2. Computational Geometry Algorithms Library (CGAL). http://www.cgal.org . Accessed 17 Apr 2018
3. Fan, K.: On the Krein–Milman theorem. Convexity 7, 211–220 (1963)
4. Gardiner, B., Lucet, Y.: Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis. Set-Valued Var. Anal. 18(3–4), 467–482 (2010)
5. Gardiner, B., Lucet, Y.: Graph-matrix calculus for computational convex analysis. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, volume 49 of Springer Optimization and Its Applications, pp. 243–259. Springer, New York (2011)