IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/594801.html
   My bibliography  Save this paper

The transportation problem with conflicts

Author

Listed:
  • Annette Ficker
  • Frits Spieksma
  • Gerhard Woeginger

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 receive supply from at most one demand node of each conflicting pair. Likewise, each demand node may only send supply to 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 Ficker & Frits Spieksma & Gerhard Woeginger, 2017. "The transportation problem with conflicts," Working Papers of Department of Decision Sciences and Information Management, Leuven 594801, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    • Handle: RePEc:ete:kbiper:594801
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/470764
    File Function: The transportation problem with conflicts
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Transportation problem; Conflict graph; Computational complexity; Approximation;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ete:kbiper:594801. 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: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    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.