Bibliography

• Amir, Yair, Baruch Awerbuch, Amnon Barak, R. Sean Borgstrom, and Arie Keren, (1998) "An Opportunity Cost Approach for Job Assignment in a Scalable Computing." https://pdfs.semanticscholar.org/5ae5/9b532f2e9f628d78651e9f77419e6575f17d.pdf Accessed August 30, 2017.
• Bertsimas, Dimitris and Ioana Popescu, (2003) "Revenue Management in a Dynamic Network Environment." Transportation Science 37(3):257-277. http://dx.doi.org/10.1287/trsc.37.3.257.16047
• Bird, R. and de Moor, O. (1993) "From dynamic programming to greedy algorithms." Formal Program Development, LNCS 755, 43-61.
• Borgstrom, R. Sean, (2000) "A Cost-Benefit Approach to Resource Allocation in Scalable Metacomputers." A dissertation submitted to The Johns Hopkins University. http://www.dsn.jhu.edu/~yairamir/RSean_thesis.pdf. Downloaded on Sep. 8, 2017.
  This dissertation uses the notion of opportunity cost to create an efficient algorithm for partitioning work in a metacomputer.
• Chapuis, Jean Michel, (2008) "Basics of Dynamic Programming for Revenue Management," Revenue & Yield Management eJournal, pp.21.
• Cormen, Thomas H, Charles Eric Leiserson, Ronald L Rivest, and Clifford Stein. (2014), Introduction to Algorithms, Cambridge, Massachusetts: The MIT Press.
  The leading graduate-level textbook on algorithms.
• Ferguson, Brian, and Guay Lim, (2005) Discrete Time Dynamic Economic Models: Theory and Empirical Applications. Routledge.
• Gnanasekaran, Viswanath Uma, (2004) "Improved Opportunity Cost Algorithm for Carrier Selection in Combinatorial Auctions", accessed August 15, 2017, http://etd.lsu.edu/docs/available/etd-06032004-230342/unrestricted/Uma_Gnanasekaran_thesis.pdf
• Huang, Kuancheng and Yu-Tung Liang, (2011) "A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem", Transportation Research Part E: Logistics and Transportation Review, Volume 47, Issue 3, Pages 333-341.
• Kennedy, John, (2012) Dynamic Programming: Applications to Agriculture and Natural Resources. Springer Science and Business Media.
• Lew, Art, (2006) "Canonical greedy algorithms and dynamic programming," Control and Cybernetics, vol. 35 no. 3. http://matwbn.icm.edu.pl/ksiazki/cc/cc35/cc3537.pdf, accessed August 5, 2017.
  Paper on greedy vs. dynamic that outlines the cases in which we can make the greedy choice in a lengthy mathematical argument. The paper is sound, but the distinction we make is much simpler to grasp.
• Pillac, Victor, Christelle Gueret, and Andres Medaglia, (2011) “Dynamic Vehicle Routing Problems: State of the art and Prospects.” https://hal.archives-ouvertes.fr/hal-00623474/file/Pillac2010_-_Dynamic_vehicle_routing_problems_-_state_of_the_art_and_prospects.pdf. Accessed August 30, 2017.
• Puterman, Martin L. (2014) Dynamic Programming and Its Applications: Proceedings of the International Conference on Dynamic Programming and Its Applications, University of British Columbia, Vancouver, British Columbia, Canada, April 14-16, 1977. Academic Press.
• Unknown, (2016) "An Approximate Dynamic Programming Approach to Attended Home Delivery Management", accessed June 21, 2017, http://repository.essex.ac.uk/17606/1/HomeDelivery_ADP_noname.pdf.