IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1977i7p737-744.html
   My bibliography  Save this article

Finding Equivalent Network Formulations for Constrained Network Problems

Author

Listed:
  • Darwin Klingman

    (University of Texas at Austin)

Abstract

This paper describes a procedure for determining if constrained network problems (i.e., network problems with additional linear constraints) can be transformed into equivalent pure network problems by a linear transformation involving the node constraints and the extra constraints. These results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables. This has proved to be an effective managerial technique for a major automobile manufacturer and a major energy modeling company.

Suggested Citation

  • Darwin Klingman, 1977. "Finding Equivalent Network Formulations for Constrained Network Problems," Management Science, INFORMS, vol. 23(7), pages 737-744, March.
    • Handle: RePEc:inm:ormnsc:v:23:y:1977:i:7:p:737-744
    DOI: 10.1287/mnsc.23.7.737
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.7.737
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.7.737?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. Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos, 2022. "A novel approach to subgraph selection with multiple weights on arcs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 242-268, August.
    2. Nalân Gülpinar & Gautam Mitra & Istvan Maros, 1998. "Detecting embedded pure network structures in LP problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(1), pages 67-95, June.
    3. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.

    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:ormnsc:v:23:y:1977:i:7:p:737-744. 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.