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

Data Structures and Computer Science Techniques in Operations Research

Author

Listed:
  • B. L. Fox

    (University of Montreal, Montreal, Quebec)

Abstract

We discuss some important data structures and computer science techniques, and their applications to operations research problems. The purpose of our discussion of applications, some of which are novel, is to stimulate further reading, for which adequate references are given. The techniques that we discuss are among the most important, but many valuable ones had to be omitted.

Suggested Citation

  • B. L. Fox, 1978. "Data Structures and Computer Science Techniques in Operations Research," Operations Research, INFORMS, vol. 26(5), pages 686-717, October.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:5:p:686-717
    DOI: 10.1287/opre.26.5.686
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.5.686
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.5.686?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
    ---><---

    Citations

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


    Cited by:

    1. van der Zijpp, N.J. & Fiorenzo Catalano, S., 2005. "Path enumeration by finding the constrained K-shortest paths," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 545-563, July.
    2. Jayakrishnan, R. & Rathi, U. & Rindt, C. & Vaideeshwaran, G., 1996. "Enhancements To A Simulation Framework For Analyzing Urban Traffic Networks With Atis/atms," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2zq344n0, Institute of Transportation Studies, UC Berkeley.
    3. Yen‐Liang Chen & Kwei Tang, 2005. "Finding the Kth shortest path in a time‐schedule network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 93-102, February.
    4. Y-L Chen & L-J Hsiao & K Tang, 2003. "Time analysis for planning a path in a time-window network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 860-870, August.

    More about this item

    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:26:y:1978:i:5:p:686-717. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.