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

The maximum balanced subgraph of a signed graph: Applications and solution approaches

Author

Listed:
  • Figueiredo, Rosa
  • Frota, Yuri

Abstract

The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. This paper is the first one to discuss applications of the MBSP arising in three different research areas: the detection of embedded structures, portfolio analysis in risk management and community structure. The efficient solution of the MBSP is also in the focus of this paper. We discuss pre-processing routines and heuristic solution approaches to the problem. a GRASP metaheuristic is developed and improved versions of a greedy heuristic are discussed. Extensive computational experiments are carried out on a set of instances from the applications previously mentioned as well as on a set of random instances.

Suggested Citation

  • Figueiredo, Rosa & Frota, Yuri, 2014. "The maximum balanced subgraph of a signed graph: Applications and solution approaches," European Journal of Operational Research, Elsevier, vol. 236(2), pages 473-487.
    • Handle: RePEc:eee:ejores:v:236:y:2014:i:2:p:473-487
    DOI: 10.1016/j.ejor.2013.12.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713010205
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.12.036?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. Thomas A. Feo & Mauricio G. C. Resende & Stuart H. Smith, 1994. "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research, INFORMS, vol. 42(5), pages 860-878, October.
    2. Harary, Frank & Kabell, Jerald A., 1980. "A simple algorithm to detect balance in signed graphs," Mathematical Social Sciences, Elsevier, vol. 1(1), pages 131-136, September.
    3. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "Pre-processing techniques for resource allocation in the heterogeneous case," European Journal of Operational Research, Elsevier, vol. 107(2), pages 470-491, June.
    4. Falk Hüffner & Nadja Betzler & Rolf Niedermeier, 2010. "Separator-based data reduction for signed graph balancing," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 335-360, November.
    5. Steffen Rebennack & Marcus Oswald & Dirk Oliver Theis & Hanna Seitz & Gerhard Reinelt & Panos M. Pardalos, 2011. "A Branch and Cut solver for the maximum stable set problem," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 434-457, May.
    6. Macon, Kevin T. & Mucha, Peter J. & Porter, Mason A., 2012. "Community structure in the United Nations General Assembly," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 343-361.
    7. Martí, Rafael & Resende, Mauricio G.C. & Ribeiro, Celso C., 2013. "Multi-start methods for combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 226(1), pages 1-8.
    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. Du, Haifeng & He, Xiaochen & Wang, Shanfeng & Gong, Maoguo & Feldman, Marcus W., 2017. "Optimizing transformations of structural balance in signed networks with potential relationships," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 414-424.
    2. Dewan F. Wahid & Elkafi Hassini, 2022. "A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis," SN Operations Research Forum, Springer, vol. 3(3), pages 1-42, September.
    3. Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond, 2017. "Evaluating balancing on social networks through the efficient solution of correlation clustering problems," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 467-498, December.
    4. Eduardo Queiroga & Anand Subramanian & Rosa Figueiredo & Yuri Frota, 2021. "Integer programming formulations and efficient local search for relaxed correlation clustering," Journal of Global Optimization, Springer, vol. 81(4), pages 919-966, December.
    5. Zacharie Ales & Céline Engelbeen & Rosa Figueiredo, 2024. "Correlation Clustering Problem Under Mediation," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 672-689, March.

    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. Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond, 2017. "Evaluating balancing on social networks through the efficient solution of correlation clustering problems," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 467-498, December.
    2. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
    3. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
    4. Omar J. Ibarra-Rojas & Fernando López-Irarragorri & Yasmin A. Rios-Solis, 2016. "Multiperiod Bus Timetabling," Transportation Science, INFORMS, vol. 50(3), pages 805-822, August.
    5. He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    6. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    7. David Raba & Rafael D. Tordecilla & Pedro Copado & Angel A. Juan & Daniel Mount, 2022. "A Digital Twin for Decision Making on Livestock Feeding," Interfaces, INFORMS, vol. 52(3), pages 267-282, May.
    8. David Bergman & Andre A. Cire & Willem-Jan van Hoeve & J. N. Hooker, 2014. "Optimization Bounds from Binary Decision Diagrams," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 253-268, May.
    9. Rafael Esteves Mansano & Luiz Emilio Allem & Renata Raposo Del-Vecchio & Carlos Hoppen, 2022. "Balanced portfolio via signed graphs and spectral clustering in the Brazilian stock market," Quality & Quantity: International Journal of Methodology, Springer, vol. 56(4), pages 2325-2340, August.
    10. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    11. Mario Pavone & Giuseppe Narzisi & Giuseppe Nicosia, 2012. "Clonal selection: an immunological algorithm for global optimization over continuous spaces," Journal of Global Optimization, Springer, vol. 53(4), pages 769-808, August.
    12. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
    13. Feng, Ju & Shen, Wen Zhong, 2017. "Design optimization of offshore wind farms with multiple types of wind turbines," Applied Energy, Elsevier, vol. 205(C), pages 1283-1297.
    14. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
    15. Nasirian, Farzaneh & Mahdavi Pajouh, Foad & Balasundaram, Balabhaskar, 2020. "Detecting a most closeness-central clique in complex networks," European Journal of Operational Research, Elsevier, vol. 283(2), pages 461-475.
    16. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Castillo, Cristian & Alvarez-Palau, Eduard J. & Calvet, Laura & Panadero, Javier & Viu-Roig, Marta & Serena-Latre, Anna & Juan, Angel A., 2024. "Home healthcare in Spanish rural areas: Applying vehicle routing algorithms to health transport management," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    18. Mendes, André Bergsten & e Alvelos, Filipe Pereira, 2023. "Iterated local search for the placement of wildland fire suppression resources," European Journal of Operational Research, Elsevier, vol. 304(3), pages 887-900.
    19. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Bukh, A.V. & Kashtanova, S.V. & Shepelev, I.A., 2023. "Complex error minimization algorithm with adaptive change rate," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).

    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:236:y:2014:i:2:p:473-487. 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.