IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v6y1998i1p67-95.html
   My bibliography  Save this article

Detecting embedded pure network structures in LP problems

Author

Listed:
  • Nalân Gülpinar
  • Gautam Mitra
  • Istvan Maros

Abstract

No abstract is available for this item.

Suggested Citation

  • Nalân Gülpinar & Gautam Mitra & Istvan Maros, 1998. "Detecting embedded pure network structures in LP problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(1), pages 67-95, June.
    • Handle: RePEc:spr:topjnl:v:6:y:1998:i:1:p:67-95
    DOI: 10.1007/BF02564799
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Baker, Barrie M. & Maye, P. J., 1993. "A heuristic for finding embedded network structure in mathematical programmes," European Journal of Operational Research, Elsevier, vol. 67(1), pages 52-63, May.
    2. Darwin Klingman, 1977. "Finding Equivalent Network Formulations for Constrained Network Problems," Management Science, INFORMS, vol. 23(7), pages 737-744, March.
    3. Robert E. Bixby & William H. Cunningham, 1980. "Converting Linear Programs to Network Problems," Mathematics of Operations Research, INFORMS, vol. 5(3), pages 321-357, August.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Xujin Chen & Zhibin Chen & Wenan Zang, 2010. "A Unified Approach to Box-Mengerian Hypergraphs," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 655-668, August.
    3. Michael O. Ball & Robert Hoffman & Amedeo R. Odoni & Ryan Rifkin, 2003. "A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem," Operations Research, INFORMS, vol. 51(1), pages 167-171, February.
    4. Ç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.
    5. 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.
    6. Ali, Agha Iqbal & Han, Hyun-Soo, 1998. "Computational implementation of Fujishige's graph realizability algorithm," European Journal of Operational Research, Elsevier, vol. 108(2), pages 452-463, July.
    7. Elsie Sterbin Gottlieb, 2002. "Solving generalized transportation problems via pure transportation problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 666-685, October.

    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:topjnl:v:6:y:1998:i:1:p:67-95. 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: 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.