IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v92y1996i1p37-53.html
   My bibliography  Save this article

An implementation of linear and nonlinear multicommodity network flows

Author

Listed:
  • Castro, J.
  • Nabona, N.

Abstract

No abstract is available for this item.

Suggested Citation

  • Castro, J. & Nabona, N., 1996. "An implementation of linear and nonlinear multicommodity network flows," European Journal of Operational Research, Elsevier, vol. 92(1), pages 37-53, July.
  • Handle: RePEc:eee:ejores:v:92:y:1996:i:1:p:37-53
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00137-9
    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. Gordon H. Bradley & Gerald G. Brown & Glenn W. Graves, 1977. "Exceptional Paper--Design and Implementation of Large Scale Primal Transshipment Algorithms," Management Science, INFORMS, vol. 24(1), pages 1-34, September.
    2. A. Ali & R. Helgason & J. Kennington & H. Lall, 1980. "Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms," Operations Research, INFORMS, vol. 28(4), pages 995-1000, 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. Amy Cohn & Sarah Root & Alex Wang & Douglas Mohr, 2007. "Integration of the Load-Matching and Routing Problem with Equipment Balancing for Small Package Carriers," Transportation Science, INFORMS, vol. 41(2), pages 238-252, May.
    2. Antonio Frangioni & Claudio Gentile & Enrico Grande & Andrea Pacifici, 2011. "Projected Perspective Reformulations with Applications in Design Problems," Operations Research, INFORMS, vol. 59(5), pages 1225-1232, October.
    3. P. Chardaire & G. P. McKeown & S. A. Verity-Harrison & S. B. Richardson, 2005. "Solving a Time-Space Network Formulation for the Convoy Movement Problem," Operations Research, INFORMS, vol. 53(2), pages 219-230, April.
    4. John W. Mamer & Richard D. McBride, 2000. "A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem," Management Science, INFORMS, vol. 46(5), pages 693-709, May.
    5. Mijangos, E., 2005. "An efficient method for nonlinearly constrained networks," European Journal of Operational Research, Elsevier, vol. 161(3), pages 618-635, March.
    6. Richard D. McBride & John W. Mamer, 2004. "Implementing an LU Factorization for the Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 109-119, May.
    7. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    8. F. Guerriero & P. Tseng, 2002. "Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 113-144, October.
    9. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    10. Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.
    11. Dushmanta Dutta & Jie Chen & Dave Penton & Matthew Bethune & Wendy Welsh & Shaun Kim & Tony Sheedy & Alistair Korn, 2014. "Examining Two Different Approaches to Modelling Management and Operation Rules in a Single River System Model," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 28(6), pages 1713-1732, April.
    12. Antonio Frangioni & Antonio Manca, 2006. "A Computational Study of Cost Reoptimization for Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 61-70, February.
    13. Luca Di Gaspero & Johannes Gärtner & Guy Kortsarz & Nysret Musliu & Andrea Schaerf & Wolfgang Slany, 2007. "The minimum shift design problem," Annals of Operations Research, Springer, vol. 155(1), pages 79-105, November.
    14. 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.
    15. Castro, Jordi & Gonzalez, Jose A., 2004. "A nonlinear optimization package for long-term hydrothermal coordination," European Journal of Operational Research, Elsevier, vol. 154(3), pages 641-658, May.

    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. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    2. George, John A. & Kuan, Chong Juin & Ring, Brendan J., 1995. "Confidentiality control of tabulated data: Some practical network models," European Journal of Operational Research, Elsevier, vol. 85(3), pages 454-472, September.
    3. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    4. Joseph C. Hartman, 2000. "The parallel replacement problem with demand and capital budgeting constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 40-56, February.
    5. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    6. 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.
    7. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    8. Rina R. Schneur & James B. Orlin, 1998. "A Scaling Algorithm for Multicommodity Flow Problems," Operations Research, INFORMS, vol. 46(2), pages 231-246, April.
    9. Mijangos, E., 2005. "An efficient method for nonlinearly constrained networks," European Journal of Operational Research, Elsevier, vol. 161(3), pages 618-635, March.
    10. Vizcaino González, José Federico & Lyra, Christiano & Usberti, Fábio Luiz, 2012. "A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks," European Journal of Operational Research, Elsevier, vol. 222(1), pages 149-156.

    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:92:y:1996:i:1:p:37-53. 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.