IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1433.html
   My bibliography  Save this paper

On the single-source unsplittable flow problem

Author

Listed:
  • DINITZ, Yefim
  • GARG, Naveen
  • GOEMANS, Michel X.

Abstract

No abstract is available for this item.

Suggested Citation

  • DINITZ, Yefim & GARG, Naveen & GOEMANS, Michel X., 1999. "On the single-source unsplittable flow problem," LIDAM Reprints CORE 1433, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1433
    DOI: 10.1007/s004930050043
    Note: In : Combinatorica, 19(1), 17-41, 1999
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Changyong Zhang, 2017. "An origin-based model for unique shortest path routing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 935-951, August.
    2. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    3. Lichun Chen & Elise Miller‐Hooks, 2008. "The building evacuation problem with shared information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 363-376, June.
    4. Danial Davarnia & Jean-Philippe P. Richard & Ece Içyüz-Ay & Bijan Taslimi, 2019. "Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling," Operations Research, INFORMS, vol. 67(4), pages 1053-1068, July.
    5. F. B. Shepherd & A. Vetta, 2007. "The Demand-Matching Problem," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 563-578, August.
    6. Ágnes Cseh & Brian C. Dean, 2016. "Improved algorithmic results for unsplittable stable allocation problems," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 657-671, October.

    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:cor:louvrp:1433. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.