IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v20y1990i4p7-27.html
   My bibliography  Save this article

Netform Modeling and Applications

Author

Listed:
  • Fred Glover

    (School of Business, University of Colorado, Boulder, Colorado 80309-0419)

  • Darwin Klingman

    (Graduate School of Business, The University of Texas, Austin, Texas 78712)

  • Nancy Phillips

    (Graduate School of Business, The University of Texas, Austin, Texas 78712)

Abstract

Many real-world applications have profited from netform innovations in both modeling and solution strategies. Practical experience shows that advances in netform modeling and solution strategies overcome many of the difficulties in conceptual design and problem solving of previous approaches to system optimization. Moreover, they provide the type of technologies required of truly useful decision-planning tools, technologies that facilitate modeling, solution, and implementation. The ultimate test and worth of computer-based planning models, however, depends on their use by practitioners. In this tutorial, we show how certain algebraic models can be viewed graphically using netform modeling and describe several large practical problems we have solved. Some of our insights can make it easier for practitioners to take advantage of these technologies.

Suggested Citation

  • Fred Glover & Darwin Klingman & Nancy Phillips, 1990. "Netform Modeling and Applications," Interfaces, INFORMS, vol. 20(4), pages 7-27, August.
    • Handle: RePEc:inm:orinte:v:20:y:1990:i:4:p:7-27
    DOI: 10.1287/inte.20.4.7
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.20.4.7
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.20.4.7?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. Goldfarb, Donald. & Jin, Zhiying. & Orlin, James B., 1953-., 1996. "Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem," Working papers 3909-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    3. Kevin D. Wayne, 2002. "A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 445-459, August.
    4. Dewil, R. & Vansteenwegen, P. & Cattrysse, D. & Van Oudheusden, D., 2015. "A minimum cost network flow model for the maximum covering and patrol routing problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 27-36.
    5. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2022. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," Annals of Operations Research, Springer, vol. 314(1), pages 185-212, July.
    6. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2020. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," 4OR, Springer, vol. 18(4), pages 387-417, December.

    More about this item

    Keywords

    networks/graphics: applications;

    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:orinte:v:20:y:1990:i:4:p:7-27. 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.