IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v124y2003i1p35-4810.1023-banor.0000004761.99649.a5.html
   My bibliography  Save this article

Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm

Author

Listed:
  • Jordi Castro

Abstract

Due to recent advances in the development of linear programming solvers, some of the formerly considered difficult multicommodity problems can today be solved in few minutes, even faster than with specialized methods. However, for other kind of multicommodity instances, general linear solvers can still be quite inefficient. In this paper we will give an overview of the current state-of-the-art in solving large-scale multicommodity problems, comparing an specialized interior-point algorithm with CPLEX 6.5 in the solution of difficult multicommodity problems of up to 1 million of variables and 300,000 constraints. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Jordi Castro, 2003. "Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm," Annals of Operations Research, Springer, vol. 124(1), pages 35-48, November.
    • Handle: RePEc:spr:annopr:v:124:y:2003:i:1:p:35-48:10.1023/b:anor.0000004761.99649.a5
    DOI: 10.1023/B:ANOR.0000004761.99649.a5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000004761.99649.a5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000004761.99649.a5?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.

    Citations

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


    Cited by:

    1. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.

    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:124:y:2003:i:1:p:35-48:10.1023/b:anor.0000004761.99649.a5. 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: 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.