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

Blockmodels with maximum concentration

Author

Listed:
  • Jessop, Alan

Abstract

No abstract is available for this item.

Suggested Citation

  • Jessop, Alan, 2003. "Blockmodels with maximum concentration," European Journal of Operational Research, Elsevier, vol. 148(1), pages 56-64, July.
    • Handle: RePEc:eee:ejores:v:148:y:2003:i:1:p:56-64
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00361-2
    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. R. Luce, 1950. "Connectivity and generalized cliques in sociometric group structure," Psychometrika, Springer;The Psychometric Society, vol. 15(2), pages 169-190, June.
    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. Proll, Les, 2007. "ILP approaches to the blockmodel problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 840-850, March.
    2. Xiaoling Zhang & Decai Tang & Yi Li & Valentina Boamah & Yisi Liu, 2022. "Analysis of OFDI Industry Linkage Network Based on Grey Incidence: Taking the Jiangsu Manufacturing Industry as an Example," Sustainability, MDPI, vol. 14(9), pages 1-17, May.
    3. Carlos Pestana Barros & Shunsuke Managi & Yuichiro Yoshida, 2010. "Technical Efficiency, Regulation And Heterogeneity In Japanese Airports," Pacific Economic Review, Wiley Blackwell, vol. 15(5), pages 685-696, December.
    4. A Jessop, 2006. "A measure of competitiveness in leagues: a network approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1425-1434, December.
    5. Jessop, Alan, 2009. "A multicriteria blockmodel for performance assessment," Omega, Elsevier, vol. 37(1), pages 204-214, February.
    6. Alan Jessop, 2010. "An optimising approach to alternative clustering schemes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(3), pages 293-309, September.

    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. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
    2. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    3. Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
    4. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.
    5. Maciej Rysz & Foad Mahdavi Pajouh & Pavlo Krokhmal & Eduardo L. Pasiliao, 2018. "Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights," Annals of Operations Research, Springer, vol. 262(1), pages 89-108, March.
    6. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
    7. Stephen P. Borgatti & Daniel S. Halgin, 2011. "On Network Theory," Organization Science, INFORMS, vol. 22(5), pages 1168-1181, October.
    8. Richard D. Alba & Gwen Moore, 1978. "Elite Social Circles," Sociological Methods & Research, , vol. 7(2), pages 167-188, November.
    9. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    10. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 0. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
    11. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    12. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    13. Korotaev, Andrey (Коротаев, Андрей) & Shulgin, Sergey (Шульгин, Сергей) & Zinkina, Yulia (Зинькина, Юлия), 2017. "Country Risk Analysis Based on Demographic and Socio-Economic Data [Анализ Страновых Рисков С Использованием Демографических И Социально-Экономических Данных]," Working Papers 031715, Russian Presidential Academy of National Economy and Public Administration.
    14. Richard C. Roistacher, 1974. "A Review of Mathematical Methods in Sociometry," Sociological Methods & Research, , vol. 3(2), pages 123-171, November.
    15. Vladimir Boginski & Sergiy Butenko & Oleg Shirokikh & Svyatoslav Trukhanov & Jaime Gil Lafuente, 2014. "A network-based data mining approach to portfolio selection via weighted clique relaxations," Annals of Operations Research, Springer, vol. 216(1), pages 23-34, May.
    16. Yuichi Asahiro & Tomohiro Kubo & Eiji Miyano, 2019. "Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 143-161, October.
    17. Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
    18. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.
    19. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 2018. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 20(5), pages 1041-1052, October.
    20. Yajun Lu & Hosseinali Salemi & Balabhaskar Balasundaram & Austin Buchanan, 2022. "On Fault-Tolerant Low-Diameter Clusters in Graphs," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3181-3199, November.

    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:148:y:2003:i:1:p:56-64. 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.