IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v9y1992i1p17-41.html
   My bibliography  Save this article

Clustering and clique partitioning: Simulated annealing and tabu search approaches

Author

Listed:
  • Saul Amorim
  • Jean-Pierre Barthélemy
  • Celso Ribeiro

Abstract

No abstract is available for this item.

Suggested Citation

  • Saul Amorim & Jean-Pierre Barthélemy & Celso Ribeiro, 1992. "Clustering and clique partitioning: Simulated annealing and tabu search approaches," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 17-41, January.
    • Handle: RePEc:spr:jclass:v:9:y:1992:i:1:p:17-41
    DOI: 10.1007/BF02618466
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02618466
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02618466?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. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    2. Pierre Barthelemy, Jean & Monjardet, Bernard, 1981. "The median procedure in cluster analysis and social choice theory," Mathematical Social Sciences, Elsevier, vol. 1(3), pages 235-267, May.
    3. Burkard, R. E. & Rendl, F., 1984. "A thermodynamically motivated simulation procedure for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 17(2), pages 169-174, August.
    4. Chams, M. & Hertz, A. & de Werra, D., 1987. "Some experiments with simulated annealing for coloring graphs," European Journal of Operational Research, Elsevier, vol. 32(2), pages 260-266, November.
    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. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    2. Marc Robini & Pierre-Jean Reissman, 2013. "From simulated annealing to stochastic continuation: a new trend in combinatorial optimization," Journal of Global Optimization, Springer, vol. 56(1), pages 185-215, May.
    3. Chen, Jiayu & Jain, Rishee K. & Taylor, John E., 2013. "Block Configuration Modeling: A novel simulation model to emulate building occupant peer networks and their impact on building energy consumption," Applied Energy, Elsevier, vol. 105(C), pages 358-368.
    4. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.
    5. Carla Inguaggiato & Michele Graziano Ceddia & Maurice Tschopp & Dimitris Christopoulos, 2021. "Collaborative Governance Networks: A Case Study of Argentina’s Forest Law," Sustainability, MDPI, vol. 13(18), pages 1-14, September.
    6. Olivier Hudry & Bernard Monjardet, 2010. "Consensus theories: an oriented survey," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00504974, HAL.
    7. Coleman, Dan & Dong, Xioapeng & Hardin, Johanna & Rocke, David M. & Woodruff, David L., 1999. "Some computational issues in cluster analysis with no a priori metric," Computational Statistics & Data Analysis, Elsevier, vol. 31(1), pages 1-11, July.
    8. Michael Brusco & Douglas Steinley, 2011. "A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 612-633, October.
    9. Rosanna Grassi & Paolo Bartesaghi & Stefano Benati & Gian Paolo Clemente, 2021. "Multi-Attribute Community Detection in International Trade Network," Networks and Spatial Economics, Springer, vol. 21(3), pages 707-733, September.
    10. Yi Zhou & Jin-Kao Hao & Adrien Goëffon, 2016. "A three-phased local search approach for the clique partitioning problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 469-491, August.
    11. Ah-Pine, Julien, 2022. "Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1069-1078.
    12. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.

    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. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    2. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    3. Anderson, E. J., 1996. "Mechanisms for local search," European Journal of Operational Research, Elsevier, vol. 88(1), pages 139-151, January.
    4. Drexl, Andreas & Nikulin, Yury, 2005. "Multicriteria airport gate assignment and pareto simulated annealing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 586, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
    6. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    7. Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    8. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    9. Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
    10. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    11. Hannu Salonen, 2014. "Aggregating and Updating Information," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 8(2), pages 55-67, October.
    12. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    13. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2014. "The Condorcet set: Majority voting over interconnected propositions," Journal of Economic Theory, Elsevier, vol. 151(C), pages 268-303.
    14. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2011. "Condorcet admissibility: Indeterminacy and path-dependence under majority voting on interconnected decisions," MPRA Paper 32434, University Library of Munich, Germany.
    15. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    16. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
    17. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
    18. Marcus Pivato, 2013. "Voting rules as statistical estimators," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 581-630, February.
    19. 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.
    20. Adenso-Diaz, Belarmino, 1996. "An SA/TS mixture algorithm for the scheduling tardiness problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 516-524, February.

    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:jclass:v:9:y:1992:i:1:p:17-41. 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.