IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v162y2005i1p55-69.html
   My bibliography  Save this article

Minimal multicut and maximal integer multiflow: A survey

Author

Listed:
  • Costa, Marie-Christine
  • Letocart, Lucas
  • Roupin, Frederic

Abstract

No abstract is available for this item.

Suggested Citation

  • Costa, Marie-Christine & Letocart, Lucas & Roupin, Frederic, 2005. "Minimal multicut and maximal integer multiflow: A survey," European Journal of Operational Research, Elsevier, vol. 162(1), pages 55-69, April.
  • Handle: RePEc:eee:ejores:v:162:y:2005:i:1:p:55-69
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00834-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Olivier Goldschmidt & Dorit S. Hochbaum, 1994. "A Polynomial Algorithm for the k-cut Problem for Fixed k," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 24-37, February.
    2. B. Rothschild & A. Whinston, 1966. "On Two Commodity Network Flows," Operations Research, INFORMS, vol. 14(3), pages 377-387, June.
    3. James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
    4. Rita Vachani & Alexander Shulman & Peter Kubat & Julie Ward, 1996. "Multicommodity Flows in Ring Networks," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 235-242, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Akgün, Ibrahim & Tansel, Barbaros Ç. & Kevin Wood, R., 2011. "The multi-terminal maximum-flow network-interdiction problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 241-251, June.
    2. Guo, Jiong & Huffner, Falk & Kenar, Erhan & Niedermeier, Rolf & Uhlmann, Johannes, 2008. "Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs," European Journal of Operational Research, Elsevier, vol. 186(2), pages 542-553, April.
    3. Bentz, Cédric & Costa, Marie-Christine & Létocart, Lucas & Roupin, Frédéric, 2009. "Multicuts and integral multiflows in rings," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1251-1254, August.
    4. Walid Ben-Ameur & Mohamed Didi Biha, 2016. "Extended cuts," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1034-1044, April.
    5. Guan, Xiucui & Zhang, Jianzhong, 2007. "Improving multicut in directed trees by upgrading nodes," European Journal of Operational Research, Elsevier, vol. 183(3), pages 971-980, December.
    6. Bocquillon, Ronan & Jouglet, Antoine & Carlier, Jacques, 2015. "The data transfer problem in a system of systems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 392-403.
    7. Lihui Bai & Donald Hearn & Siriphong Lawphongpanich, 2010. "A heuristic method for the minimum toll booth problem," Journal of Global Optimization, Springer, vol. 48(4), pages 533-548, December.
    8. Bentz, Cédric & Cornaz, Denis & Ries, Bernard, 2013. "Packing and covering with linear programming: A survey," European Journal of Operational Research, Elsevier, vol. 227(3), pages 409-422.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dereniowski, Dariusz & Kubiak, Wiesław, 2020. "Shared processor scheduling of multiprocessor jobs," European Journal of Operational Research, Elsevier, vol. 282(2), pages 464-477.
    2. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    3. Wang, Gang, 2024. "Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains," Omega, Elsevier, vol. 124(C).
    4. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    5. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    6. Yan T. Yang & Barak Fishbain & Dorit S. Hochbaum & Eric B. Norman & Erik Swanberg, 2014. "The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 45-58, February.
    7. László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
    8. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    9. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    10. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    11. Adam N. Letchford, 2000. "Separating a Superclass of Comb Inequalities in Planar Graphs," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 443-454, August.
    12. László A. Végh, 2014. "Concave Generalized Flows with Applications to Market Equilibria," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 573-596, May.
    13. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    14. Marie-Christine Costa & Dominique Werra & Christophe Picouleau, 2011. "Minimum d-blockers and d-transversals in graphs," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 857-872, November.
    15. Ravindra K. Ahuja & Dorit S. Hochbaum, 2008. "TECHNICAL NOTE---Solving Linear Cost Dynamic Lot-Sizing Problems in O ( n log n ) Time," Operations Research, INFORMS, vol. 56(1), pages 255-261, February.
    16. Ons Sassi & Ammar Oulamara, 2017. "Electric vehicle scheduling and optimal charging problem: complexity, exact and heuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 519-535, January.
    17. Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
    18. P. Chardaire & A. Lisser, 2002. "Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems," Operations Research, INFORMS, vol. 50(2), pages 260-276, April.
    19. Lin, Yi-Kuei, 2006. "A simple algorithm to generate all (d,B)-MCs of a multicommodity stochastic-flow network," Reliability Engineering and System Safety, Elsevier, vol. 91(8), pages 923-929.
    20. Lin, Yi-Kuei, 2007. "Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity," Reliability Engineering and System Safety, Elsevier, vol. 92(5), pages 646-652.

    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:eee:ejores:v:162:y:2005:i:1:p:55-69. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.