IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2385.html
   My bibliography  Save this paper

A faster algorithm for finding the minimum cut in a graph

Author

Listed:
  • Hao, Jianxiu.
  • Orlin, James B., 1953-.

Abstract

No abstract is available for this item.

Suggested Citation

  • Hao, Jianxiu. & Orlin, James B., 1953-., 1992. "A faster algorithm for finding the minimum cut in a graph," Working papers 3372-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2385
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2385
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. L. Fleischer & É. Tardos, 1999. "Separating Maximally Violated Comb Inequalities in Planar Graphs," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 130-148, February.
    2. Charles Bordenave & Michel Gendreau & Gilbert Laporte, 2009. "A branch‐and‐cut algorithm for the nonpreemptive swapping problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(5), pages 478-486, August.
    3. Egon Balas & Matteo Fischetti, 1999. "Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 273-292, May.
    4. Cynthia Barnhart & Natashia L. Boland & Lloyd W. Clarke & Ellis L. Johnson & George L. Nemhauser & Rajesh G. Shenoi, 1998. "Flight String Models for Aircraft Fleeting and Routing," Transportation Science, INFORMS, vol. 32(3), pages 208-220, August.
    5. Aggarwal, Charu C. (Charu Chandra) & Hao, Jianxiu. & Orlin, James B., 1953-, 1994. "Diagnosing infeasibilities in network flow problems," Working papers 3696-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. Junran Lichen, 2023. "Cycle-connected mixed graphs and related problems," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-19, January.
    7. Boland, N. L. & Clarke, L. W. & Nemhauser, G. L., 2000. "The asymmetric traveling salesman problem with replenishment arcs," European Journal of Operational Research, Elsevier, vol. 123(2), pages 408-427, June.
    8. Gorka Kobeaga & María Merino & Jose A. Lozano, 2021. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms," Annals of Operations Research, Springer, vol. 305(1), pages 107-136, October.

    More about this item

    Keywords

    HD28 .M414 no.3372-; 92;

    JEL classification:

    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:mit:sloanp:2385. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.