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

Solving embedded generalized network problems

Author

Listed:
  • McBride, Richard D.

Abstract

No abstract is available for this item.

Suggested Citation

  • McBride, Richard D., 1985. "Solving embedded generalized network problems," European Journal of Operational Research, Elsevier, vol. 21(1), pages 82-92, July.
    • Handle: RePEc:eee:ejores:v:21:y:1985:i:1:p:82-92
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(85)90091-8
    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.

    Citations

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


    Cited by:

    1. M. A. Venkataramana & John J. Dinkel & John Mote, 1991. "Vector processing approach to constrained network problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 71-85, February.
    2. 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.
    3. Steven A. Gabriel & Supat Kiet & Jifang Zhuang, 2005. "A Mixed Complementarity-Based Equilibrium Model of Natural Gas Markets," Operations Research, INFORMS, vol. 53(5), pages 799-818, October.
    4. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    5. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    6. Michael A. Trick, 1992. "A linear relaxation heuristic for the generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 137-151, March.
    7. 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.
    8. M. Shourian & S. Mousavi & A. Tahershamsi, 2008. "Basin-wide Water Resources Planning by Integrating PSO Algorithm and MODSIM," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 22(10), pages 1347-1366, October.
    9. Carey, Malachy & Subrahmanian, Eswaran, 2000. "An approach to modelling time-varying flows on congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 157-183, April.
    10. Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos, 2022. "A novel approach to subgraph selection with multiple weights on arcs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 242-268, August.
    11. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1997. "Stochastic network project scheduling with non-consumable limited resources," International Journal of Production Economics, Elsevier, vol. 48(1), pages 29-37, January.
    12. Yenisey, Mehmet Mutlu, 2006. "A flow-network approach for equilibrium of material requirements planning," International Journal of Production Economics, Elsevier, vol. 102(2), pages 317-332, August.
    13. Gerald Brown & Joseph Keegan & Brian Vigus & Kevin Wood, 2001. "The Kellogg Company Optimizes Production, Inventory, and Distribution," Interfaces, INFORMS, vol. 31(6), pages 1-15, December.
    14. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.

    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:21:y:1985:i:1:p:82-92. 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: 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.