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

Flows in Arborescences

Author

Listed:
  • Fred Glover

    (University of Colorado)

Abstract

This paper gives efficient methods for solving four specially structured network problems that arise in connection with certain integer programming methods developed by Cook and Cooper, Hillier, and Glover. Such problems have also independently been studied in inventory theory by Ignall and Veinott, who have developed extensive qualitative (nonalgorithmic) implications of their structures. In the integer programming context, special subclasses of these network problems are generated and solved as part of a strategy for solving more general integer linear programs. By providing particularly efficient methods for accommodating somewhat broader network structures, our results enable the development of related integer programming solution strategies that generate more complex subproblems. We show that the first of the four network problems can be solved by a procedure that assigns each variable a value exactly once, without subsequent revision. Properties of optimal solutions for the remaining problems are developed that enable the algorithm for the first to be extended to the second and then, by suitable transformation of variables, to the third and last problems as well. Moreover, while the last three problems involve an additional linear constraint that nullifies the "integer extreme point property," we show that optimal integer solutions to these problems can nevertheless easily be obtained from the optimal continuous solutions.

Suggested Citation

  • Fred Glover, 1971. "Flows in Arborescences," Management Science, INFORMS, vol. 17(9), pages 568-586, May.
  • Handle: RePEc:inm:ormnsc:v:17:y:1971:i:9:p:568-586
    DOI: 10.1287/mnsc.17.9.568
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.9.568
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.17.9.568?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. Glover, Fred, 2013. "Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems," European Journal of Operational Research, Elsevier, vol. 230(2), pages 212-225.
    2. Hanafi, Said & Glover, Fred, 2007. "Exploiting nested inequalities and surrogate constraints," European Journal of Operational Research, Elsevier, vol. 179(1), pages 50-63, May.

    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:17:y:1971:i:9:p:568-586. 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.