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

Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Author

Listed:
  • Gouveia, Luis
  • Lopes, Maria Joao

Abstract

No abstract is available for this item.

Suggested Citation

  • Gouveia, Luis & Lopes, Maria Joao, 2000. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs," European Journal of Operational Research, Elsevier, vol. 121(2), pages 394-411, March.
    • Handle: RePEc:eee:ejores:v:121:y:2000:i:2:p:394-411
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00043-0
    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. Leslie Hall, 1996. "Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 219-234, August.
    2. Anantaram Balakrishnan & Thomas L. Magnanti & Richard T. Wong, 1995. "A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning," Operations Research, INFORMS, vol. 43(1), pages 58-76, February.
    3. Luis Gouveia, 1995. "A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem," Operations Research, INFORMS, vol. 43(1), pages 130-141, February.
    4. BOUSBA, Choaib & WOLSEY, Laurence A., 1991. "Finding minimum cost directed trees with demands and capacities," LIDAM Reprints CORE 966, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    2. Gouveia, Luis & Joao Lopes, Maria, 2005. "The capacitated minimum spanning tree problem: On improved multistar constraints," European Journal of Operational Research, Elsevier, vol. 160(1), pages 47-62, January.

    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. Raymond A. Patterson & Erik Rolland, 2002. "Hybrid Fiber Coaxial Network Design," Operations Research, INFORMS, vol. 50(3), pages 538-551, June.
    2. Gen, Mitsuo & Kumar, Anup & Ryul Kim, Jong, 2005. "Recent network design techniques using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 98(2), pages 251-261, November.
    3. Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July.
    4. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    5. Gendreau, Michel & Potvin, Jean-Yves & Smires, Ali & Soriano, Patrick, 2006. "Multi-period capacity expansion for a local access telecommunications network," European Journal of Operational Research, Elsevier, vol. 172(3), pages 1051-1066, August.
    6. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    7. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    8. Mohit Tawarmalani & Yanjun Li, 2011. "Multi‐period maintenance scheduling of tree networks with minimum flow disruption," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 507-530, August.
    9. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.
    10. Kucukyazici, Beste & Ozdamar, Linet & Pokharel, Shaligram, 2005. "Developing concurrent investment plans for power generation and transmission," European Journal of Operational Research, Elsevier, vol. 166(2), pages 449-468, October.
    11. Ricardo Fukasawa & Qie He & Yongjia Song, 2016. "A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(1), pages 23-34, February.
    12. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    13. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    14. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    15. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
    16. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    17. Gouveia, Luis, 1995. "A result on projection for the vehicle routing ptoblem," European Journal of Operational Research, Elsevier, vol. 85(3), pages 610-624, September.
    18. T Öncan & İ K Altınel, 2009. "Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 259-267, February.
    19. Gouveia, Luis & Joao Lopes, Maria, 2005. "The capacitated minimum spanning tree problem: On improved multistar constraints," European Journal of Operational Research, Elsevier, vol. 160(1), pages 47-62, January.
    20. Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.

    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:121:y:2000:i:2:p:394-411. 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.