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

Computational implementation of Fujishige's graph realizability algorithm

Author

Listed:
  • Ali, Agha Iqbal
  • Han, Hyun-Soo

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:108:y:1998:i:2:p:452-463
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00167-7
    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. Robert E. Bixby & Robert Fourer, 1988. "Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics," Management Science, INFORMS, vol. 34(3), pages 342-376, March.
    2. Robert E. Bixby & Donald K. Wagner, 1988. "An Almost Linear-Time Algorithm for Graph Realization," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 99-123, February.
    3. Karla L. Hoffman & Manfred Padberg, 1991. "Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 121-134, May.
    4. 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.
    5. George L. Nemhauser, 1994. "The Age of Optimization: Solving Large-Scale Real-World Problems," Operations Research, INFORMS, vol. 42(1), pages 5-13, February.
    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. 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.
    2. Martin Durbin & Karla Hoffman, 2008. "OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment," Operations Research, INFORMS, vol. 56(1), pages 3-19, February.
    3. Luss, Hanan & Rosenwein, Moshe B., 1997. "Operations Research applications: Opportunities and accomplishments," European Journal of Operational Research, Elsevier, vol. 97(2), pages 220-244, March.
    4. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    5. 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.
    6. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
    7. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.
    8. Ahmed Redha Mahlous, 2017. "SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach," Future Internet, MDPI, vol. 9(4), pages 1-18, December.
    9. Zonghao Gu & George L. Nemhauser & Martin W. P. Savelsbergh, 1999. "Lifted Cover Inequalities for 0-1 Integer Programs: Complexity," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 117-123, February.
    10. Matthias Walter, 2023. "Recognizing Series-Parallel Matrices in Linear Time," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1404-1418, November.
    11. Diane E. Vaughan & Sheldon H. Jacobson, 2004. "Tabu Guided Generalized Hill Climbing Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 6(3), pages 343-354, September.
    12. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    13. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    14. 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.
    15. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
    16. Escudero, L. F. & Garin, A. & Perez, G., 1999. "O(n log n) procedures for tightening cover inequalities," European Journal of Operational Research, Elsevier, vol. 113(3), pages 676-687, March.
    17. 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.
    18. Robert Bixby & Edward Rothberg, 2007. "Progress in computational mixed integer programming—A look back from the other side of the tipping point," Annals of Operations Research, Springer, vol. 149(1), pages 37-41, February.
    19. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    20. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.

    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:108:y:1998:i:2:p:452-463. 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.