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. 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.
    3. 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.
    4. 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.
    5. Walid Ben-Ameur & Mohamed Didi Biha, 2016. "Extended cuts," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1034-1044, April.
    6. 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.
    7. 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.
    8. 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.

    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. Wang, Gang, 2024. "Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains," Omega, Elsevier, vol. 124(C).
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Mark Velednitsky & Dorit S. Hochbaum, 0. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-21.
    10. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    11. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
    12. Mark Velednitsky & Dorit S. Hochbaum, 2022. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1659-1679, October.
    13. Adrian Marius Deaconu & Luciana Majercsik, 2021. "Flow Increment through Network Expansion," Mathematics, MDPI, vol. 9(18), pages 1-9, September.
    14. Lin, Yi-Kuei, 2007. "Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity," International Journal of Production Economics, Elsevier, vol. 107(2), pages 572-580, June.
    15. Mourad Baïou & Francisco Barahona & Ali Ridha Mahjoub, 2000. "Separation of Partition Inequalities," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 243-254, May.
    16. Ahmed Redha Mahlous, 2017. "SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach," Future Internet, MDPI, vol. 9(4), pages 1-18, December.
    17. 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.
    18. Mehdi Ghiyasvand, 2019. "An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 957-969, April.
    19. Ding, Honglin & Li, Jianping & Lih, Ko-Wei, 2014. "Approximation algorithms for solving the constrained arc routing problem in mixed graphs," European Journal of Operational Research, Elsevier, vol. 239(1), pages 80-88.
    20. Elisa Letizia & Paolo Barucca & Fabrizio Lillo, 2018. "Resolution of ranking hierarchies in directed networks," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-25, February.

    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.