IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i6p892-898.html
   My bibliography  Save this article

George B. Dantzig: Operations Research Icon

Author

Listed:
  • Richard W. Cottle

    (Stanford University, Stanford, California 94305)

Abstract

This article recalls some of George B. Dantzig’s many contributions to operations research and the management sciences in his ninety-year lifetime.

Suggested Citation

  • Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:6:p:892-898
    DOI: 10.1287/opre.1050.0250
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1050.0250
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1050.0250?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. George Dantzig & Selmer Johnson & Wayne White, 1958. "A Linear Programming Approach to the Chemical Equilibrium Problem," Management Science, INFORMS, vol. 5(1), pages 38-43, October.
    2. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    3. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    4. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    5. Allen R. Ferguson & George B. Dantzig, 1956. "The Allocation of Aircraft to Routes--An Example of Linear Programming Under Uncertain Demand," Management Science, INFORMS, vol. 3(1), pages 45-73, October.
    6. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    7. George B. Dantzig, 1960. "On the Shortest Route Through a Network," Management Science, INFORMS, vol. 6(2), pages 187-190, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Yanwu & Tu, Yan & Zhang, Zhongzhen, 2021. "The row pivoting method for linear programming," Omega, Elsevier, vol. 100(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    2. Sinuany-Stern, Zilla, 2023. "Foundations of operations research: From linear programming to data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1069-1080.
    3. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    4. Ketabchi, Saeed & Behboodi-Kahoo, Malihe, 2015. "Augmented Lagrangian method within L-shaped method for stochastic linear programs," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 12-20.
    5. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    6. Fan, Wei & Machemehl, Randy, 2004. "A Multi-stage Monte Carlo Sampling Based Stochastic Programming Model for the Dynamic Vehicle Allocation Problem," 45th Annual Transportation Research Forum, Evanston, Illinois, March 21-23, 2004 208244, Transportation Research Forum.
    7. Warren B. Powell, 2016. "Perspectives of approximate dynamic programming," Annals of Operations Research, Springer, vol. 241(1), pages 319-356, June.
    8. Dupacova, Jitka, 2002. "Applications of stochastic programming: Achievements and questions," European Journal of Operational Research, Elsevier, vol. 140(2), pages 281-290, July.
    9. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    10. Andrew Allman & Qi Zhang, 2021. "Branch-and-price for a class of nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 81(4), pages 861-880, December.
    11. Marcel Klatt & Axel Munk & Yoav Zemel, 2022. "Limit laws for empirical optimal solutions in random linear programs," Annals of Operations Research, Springer, vol. 315(1), pages 251-278, August.
    12. Fan, Wei, 2014. "Optimizing Strategic Allocation of Vehicles for One-Way Car-sharing Systems Under Demand Uncertainty," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(3).
    13. Wu, Yue, 2010. "A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming," European Journal of Operational Research, Elsevier, vol. 207(1), pages 152-164, November.
    14. Csaba Fábián & Zoltán Szőke, 2007. "Solving two-stage stochastic programming problems with level decomposition," Computational Management Science, Springer, vol. 4(4), pages 313-353, October.
    15. A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
    16. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    17. Ethem Çanakoğlu & İbrahim Muter & Tevfik Aytekin, 2021. "Integrating Individual and Aggregate Diversity in Top- N Recommendation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 300-318, January.
    18. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    19. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    20. Metrane, Abdelmoutalib & Soumis, François & Elhallaoui, Issmail, 2010. "Column generation decomposition with the degenerate constraints in the subproblem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 37-44, November.

    More about this item

    Keywords

    professional: OR/MS history; obituaries;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:53:y:2005:i:6:p:892-898. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.