25. Bibliographic References


Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Pearson, 1993.


P. Artzner, Delbaen F., J.M. Eber, and D. Heath. Thinking coherently. Risk, 10:68–71, 1997.


M. Bazaraa, H. Sherali, and C. and Shetty. Nonlinear Programming: Theory and Algorithms. John Wiley & Sons, 1993.


E. Benavent, A. Corberán, and J. M. Sanchis. Linear Programming Based Methods for Solving Arc Routing Problems. In Moshe Dror, editor, Arc Routing: Theory, Solutions and Applications, pages 231–275. Springer US, Boston, MA, 2000.


J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238–252, 1962/63.


John R. Birge and François Louveaux. Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering. Springer New York, New York, NY, 2011. ISBN 978-1-4614-0236-7 978-1-4614-0237-4. doi:10.1007/978-1-4614-0237-4.


C. E. Blair, R. G. Jeroslow, and J. K. Lowe. Some results and experiments in programming techniques for propositional logic. Computers & Operations Research, 13(5):633–645, 1986.


Béla Bollobás. Modern graph theory. Volume 194 of Graduate Texts in Mathematics. Springer-Verlag, 1998.


Chih-Chung Chang and Chih-Jen Lin. LIBSVM: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2:27:1–27:27, 2011. URL: http://www.csie.ntu.edu.tw/~cjlin/libsvm, doi:10.1145/1961189.1961199.


A. Charnes, W. Cooper, and E. Rhodes. Measuring efficiency of decision-making units. European Journal of Operational Research, pages 429–444, 1978.


John W. Chinneck and Erik W. Dravnieks. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 3(2):157–168, 1991. doi:10.1287/ijoc.3.2.157.


William Cook. Concorde Home. URL: http://www.math.uwaterloo.ca/tsp/concorde.html.


George B. Dantzig. The Diet Problem. Interfaces, 20(4,):43–47, 1990. URL: http://www.jstor.org/stable/25061369.


George Bernard Dantzig. Linear Programming and Extensions:. RAND Corporation, 1963. Library Catalog: www.rand.org Publisher: RAND Corporation. URL: https://www.rand.org/pubs/reports/R366.html (visited on 2020-08-07).


Jack B. (Jack Bonnell) Dennis. Mathematical programming and electrical networks. Thesis, Massachusetts Institute of Technology, 1959. URL: https://dspace.mit.edu/handle/1721.1/13366 (visited on 2021-05-17).


Jack Edmonds. The Chinese postman problem. Operations Research, 13, Suppl. 1:B73–B77, 1963.


Jack Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965. doi:10.4153/CJM-1965-045-4.


John Forrest, Ted Ralphs, Haroldo Gambini Santos, Stefan Vigerske, Lou Hafer, Bjarni Kristjansson, jpfasano, EdwinStraver, Miles Lubin, rlougee, jpgoncal1, Jan-Willem, h-i-gassmann, Samuel Brito, Cristina, Matthew Saltzman, tosttost, Fumiaki Matsushima, and to-st. COIN-OR/CBC: release 2.10.7. January 2022. URL: https://doi.org/10.5281/zenodo.5904374, doi:10.5281/zenodo.5904374.


Robert Fourer. AMPL : a modeling language for mathematical programming. San Francisco, Calif. : Scientific Pr., San Francisco, Calif., 2. ed. edition, 2002.


Roberth G. Jeroslow. Logic-Based Decision Support: Mixed Integer Model Formulation. North Holland, 1989.


Marco Locatelli and Fabio Schoen. Global Optimization: theory, algorithms, and applications. Volume MO15 of MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics and the Mathematical Optimization Society, Philadelphia, USA, 2013. ISBN 978-1-611972-66-5.


Harry M. Markowitz. The early history of portfolio theory: 1600-1960. Financial Analysts Journal, 55(4):5–16, 1999. Publisher: CFA Institute.


Harry M. Markowitz. De Finetti scoops Markowitz. Journal of Investment Management, 4(3):5–18, 2006.


Edward Nelson. Radically Elementary Probability Theory. Princeton University Press, 1987.


George Nemhauser and Laurence Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 1999. doi:10.1002/9781118627372.


Temel Oncan, İ. Kuban Altınel, and Gilbert Laporte. A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & Operations Research, 36(3):637–654, March 2009. URL: https://www.sciencedirect.com/science/article/pii/S0305054807002468, doi:10.1016/j.cor.2007.11.008.


Manfred Padberg and Giovanni Rinaldi. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. SIAM Review, 33(1):60–100, March 1991. Publisher: Society for Industrial and Applied Mathematics. URL: https://epubs.siam.org/doi/abs/10.1137/1033004 (visited on 2021-05-13), doi:10.1137/1033004.


Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications Inc., 1998.


Yves Pochet and Laurence A. Wolsey. Production planning by mixed integer programming. Springer series in operations research and financial engineering. Springer, New York ; Berlin, 2006. ISBN 978-0-387-29959-4.


Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, 2003.


Stanislav Uryasev and R. Tyrrell Rockafellar. Conditional Value-at-Risk: Optimization Approach. In Stanislav Uryasev and Panos M. Pardalos, editors, Stochastic Optimization: Algorithms and Applications, pages 411–435. Springer US, Boston, MA, 2001.


John von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, 1944.


H. Paul Williams. Model Building in Mathematical Programming. J. Wiley & Sons, 5th edition, 2013. ISBN 978-1-118-44333-0.


oxinabox.github.io. Optimizing your diet with JuMP. Library Catalog: www.juliabloggers.com Section: Julia. URL: https://www.juliabloggers.com/optimizing-your-diet-with-jump-2/ (visited on 2020-08-07).