IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v298y2021i1d10.1007_s10479-018-3004-y.html
   My bibliography  Save this article

The transportation problem with conflicts

Author

Listed:
  • Annette M. C. Ficker

    (KU Leuven)

  • Frits C. R. Spieksma

    (Eindhoven University of Technology)

  • Gerhard J. Woeginger

    (RWTH Aachen)

Abstract

The transportation problem is a fundamental problem in operations research, where items need to be transported from supply nodes (each with a given supply) to demand nodes (each with a given demand) in the cheapest possible way. Here, we are interested in a generalization of the transportation problem where, each supply node has a (possibly empty) set of conflicting pairs of demand nodes, and each demand node a (possibly empty) set of conflicting pairs of supply nodes. Each supply node may only send supply to at most one demand node of each conflicting pair. Likewise, each demand node may only receive supply from at most one supply node of each conflicting pair. We call the resulting problem the transportation problem with conflicts (TPC). We show that the complexity of TPC depends upon the structure of the so-called conflict graph that follows from the conflicting pairs. More concrete, we show that for many graph-classes the corresponding TPC remains NP-hard, and for some special cases we derive constant factor approximation algorithms.

Suggested Citation

  • Annette M. C. Ficker & Frits C. R. Spieksma & Gerhard J. Woeginger, 2021. "The transportation problem with conflicts," Annals of Operations Research, Springer, vol. 298(1), pages 207-227, March.
    • Handle: RePEc:spr:annopr:v:298:y:2021:i:1:d:10.1007_s10479-018-3004-y
    DOI: 10.1007/s10479-018-3004-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-3004-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-3004-y?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
    ---><---

    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. Ulrich Pferschy & Joachim Schauer, 2013. "The maximum flow problem with disjunctive constraints," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 109-119, July.
    2. Lisa Fleischer & Michel X. Goemans & Vahab S. Mirrokni & Maxim Sviridenko, 2011. "Tight Approximation Algorithms for Maximum Separable Assignment Problems," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 416-431, August.
    3. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, 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. Borja Ena & Alberto Gomez & Borja Ponte & Paolo Priore & Diego Diaz, 2022. "Homogeneous grouping of non-prime steel products for online auctions: a case study," Annals of Operations Research, Springer, vol. 315(1), pages 591-621, August.
    2. Wu, Yaobin & Huang, Jiazhou & Chen, Xiangfeng, 2024. "The information value of logistics platforms in a freight matching market," European Journal of Operational Research, Elsevier, vol. 312(1), pages 227-239.

    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. Şuvak, Zeynep & Altınel, İ. Kuban & Aras, Necati, 2020. "Exact solution algorithms for the maximum flow problem with additional conflict constraints," European Journal of Operational Research, Elsevier, vol. 287(2), pages 410-437.
    2. Vancroonenburg, Wim & Della Croce, Federico & Goossens, Dries & Spieksma, Frits C.R., 2014. "The Red–Blue transportation problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 814-823.
    3. Kameng Nip & Zhenbo Wang, 2019. "On the approximability of the two-phase knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1155-1179, November.
    4. Goossens, D.R. & Maas, A.J.T. & Spieksma, F.C.R. & van de Klundert, J.J., 2007. "Exact algorithms for procurement problems under a total quantity discount structure," European Journal of Operational Research, Elsevier, vol. 178(2), pages 603-626, April.
    5. Iftah Gamzu & Danny Segev, 2019. "A polynomial-time approximation scheme for the airplane refueling problem," Journal of Scheduling, Springer, vol. 22(1), pages 119-135, February.
    6. Ulrich Pferschy & Joachim Schauer, 2017. "Approximation of knapsack problems with conflict and forcing graphs," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1300-1323, May.
    7. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    8. Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva, 2021. "A unifying model for locally constrained spanning tree problems," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 125-150, July.
    9. Marco Bender & Clemens Thielen & Stephan Westphal, 2017. "Online interval scheduling with a bounded number of failures," Journal of Scheduling, Springer, vol. 20(5), pages 443-457, October.
    10. Péter Györgyi & Tamás Kis, 2015. "Approximability of scheduling problems with resource consuming jobs," Annals of Operations Research, Springer, vol. 235(1), pages 319-336, December.
    11. Francesco Carrabs & Raffaele Cerulli & Rosa Pentangelo & Andrea Raiconi, 2021. "Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach," Annals of Operations Research, Springer, vol. 298(1), pages 65-78, March.
    12. Bigler, T. & Kammermann, M. & Baumann, P., 2023. "A matheuristic for a customer assignment problem in direct marketing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 689-708.
    13. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.

    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:spr:annopr:v:298:y:2021:i:1:d:10.1007_s10479-018-3004-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.