On the public citation graph
Clustering and clique partitioning: Simulated annealing and tabu search approaches
0 signed · 115 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-1677-0openalex-snapshot
Simulated Annealing for VLSI Design
inferredcites →https://doi.org/10.1007/978-94-015-7744-1openalex-snapshot
Simulated Annealing: Theory and Applications
inferredcites →https://doi.org/10.1007/bf00289116openalex-snapshot
NP-hard problems in hierarchical-tree clustering
inferredcites →https://doi.org/10.1007/bf01580870openalex-snapshot
Facets of the clique partitioning polytope
inferredcites →https://doi.org/10.1007/bf01589097openalex-snapshot
A cutting plane algorithm for a clustering problem
inferredcites →https://doi.org/10.1007/bf01719610openalex-snapshot
Analyse qualitativer Daten: Einführung und Übersicht
inferredcites →https://doi.org/10.1007/bf01719755openalex-snapshot
Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
inferredcites →https://doi.org/10.1007/bf01721080openalex-snapshot
Analyse qualitativer Daten: Einführung und Übersicht
inferredcites →https://doi.org/10.1007/bf01894188openalex-snapshot
On the use of ordered sets in problems of comparison and consensus of classifications
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bf02243141openalex-snapshot
STABULUS: A technique for finding stable sets in large graphs with tabu search
inferredcites →https://doi.org/10.1016/0031-3203(89)90067-8openalex-snapshot
Experiments in projection and clustering by simulated annealing
inferredcites →https://doi.org/10.1016/0165-4896(81)90041-xopenalex-snapshot
The median procedure in cluster analysis and social choice theory
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0377-2217(84)90231-5openalex-snapshot
A thermodynamically motivated simulation procedure for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1016/s0377-2217(87)80148-0openalex-snapshot
Some experiments with simulated annealing for coloring graphs
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0112071openalex-snapshot
Approximating Symmetric Relations by Equivalence Relations
inferredcites →https://doi.org/10.1137/1026105openalex-snapshot
The N -City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_19openalex-snapshot
A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-29608-1_1openalex-snapshot
Maximally Diverse Grouping and Clique Partitioning Problems with Skewed General Variable Neighborhood Search
inferred← citeshttps://doi.org/10.1007/978-3-642-00142-0_74openalex-snapshot
A New Branch and Bound Algorithm for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_1openalex-snapshot
Classification and Clustering: Problems for the Future
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_26openalex-snapshot
Partitioning Problems in Cluster Analysis: A Review of Mathematical Programming Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-57280-7_21openalex-snapshot
A Development Framework for Nature Analogic Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-57603-4_5openalex-snapshot
Modeling Approaches for Median Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-72253-0_24openalex-snapshot
Pertinence for a Classification
inferred← citeshttps://doi.org/10.1007/978-3-7091-7533-0_52openalex-snapshot
Clique Partitioning Problem and Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/s00186-023-00835-yopenalex-snapshot
Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s00521-020-05289-5openalex-snapshot
A novel two-model local search algorithm with a self-adaptive parameter for clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s10479-017-2665-2openalex-snapshot
Exact algorithms for the minimum s-club partitioning problem
inferred← citeshttps://doi.org/10.1007/s10878-015-9964-9openalex-snapshot
A three-phased local search approach for the clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s10898-012-9860-0openalex-snapshot
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s11067-021-09547-4openalex-snapshot
Multi-Attribute Community Detection in International Trade Network
inferred← citeshttps://doi.org/10.1007/s11336-009-9126-zopenalex-snapshot
Clustering Qualitative Data Based on Binary Equivalence Relations: Neighborhood Search Heuristics for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1007/s11336-011-9221-9openalex-snapshot
A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices
inferred← citeshttps://doi.org/10.1007/s11590-015-0869-4openalex-snapshot
Solving the clique partitioning problem as a maximally diverse grouping problem
inferred← citeshttps://doi.org/10.1007/s11634-013-0135-5openalex-snapshot
Lagrangian relaxation and pegging test for the clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s12117-011-9131-3openalex-snapshot
Listening to the wire: criteria and techniques for the quantitative analysis of phone intercepts
inferred← citeshttps://doi.org/10.1007/s12117-018-9352-9openalex-snapshot
A mixed methods social network analysis of a cross-border drug network: the Fernando Sanchez organization (FSO)
inferred← citeshttps://doi.org/10.1007/s12532-023-00249-1openalex-snapshot
CP-Lib: Benchmark Instances of the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1007/s13675-014-0028-1openalex-snapshot
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90213-5openalex-snapshot
Medians for weight metrics in the covering graphs of semilattices
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90023-aopenalex-snapshot
The noising method: a new method for combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00029-1openalex-snapshot
A comparison of neighborhood search techniques for multi-objective combinatorial problems
inferred← citeshttps://doi.org/10.1016/j.apenergy.2012.12.036openalex-snapshot
Block Configuration Modeling: A novel simulation model to emulate building occupant peer networks and their impact on building energy consumption
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107033openalex-snapshot
An efficient iterated local search for the minimum quasi-clique partitioning problem
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.029openalex-snapshot
Noising methods for a clique partitioning problem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.011openalex-snapshot
New bounds and constraint propagation techniques for the clique partitioning problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.023openalex-snapshot
The biclique partitioning polytope
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112884openalex-snapshot
An overview of graph covering and partitioning
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.12.034openalex-snapshot
Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.01.044openalex-snapshot
Fixed set search applied to the clique partitioning problem
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.073openalex-snapshot
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
inferred← citeshttps://doi.org/10.1016/j.socnet.2018.08.007openalex-snapshot
Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search
inferred← citeshttps://doi.org/10.1016/j.ssresearch.2016.04.010openalex-snapshot
Liking and hyperlinking: Community detection in online child sexual exploitation networks
inferred← citeshttps://doi.org/10.1016/s0167-9473(99)00003-1openalex-snapshot
On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation
inferred← citeshttps://doi.org/10.1016/s0167-9473(99)00009-2openalex-snapshot
Some computational issues in cluster analysis with no a priori metric
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00048-2openalex-snapshot
Solving the anti-covering location problem using Lagrangian relaxation
inferred← citeshttps://doi.org/10.1016/s0969-6016(96)00011-1openalex-snapshot
A New Composite Algorithm for Clustering Problems
inferred← citeshttps://doi.org/10.1017/s095026880500467xopenalex-snapshot
Investigating the potential spread of infectious diseases of sheep via agricultural shows in Great Britain
inferred← citeshttps://doi.org/10.1023/a:1009670031749openalex-snapshot
Query Optimization in Distributed Relational Databases
inferred← citeshttps://doi.org/10.1023/b:dami.0000031630.50685.7copenalex-snapshot
Outlier Detection and Data Cleaning in Multivariate Non-Normal Samples: The PAELLA Algorithm
inferred← citeshttps://doi.org/10.1038/s41598-025-94290-wopenalex-snapshot
Unraveling HIV-1 transmission patterns through molecular surveillance in a hotspot in Yunnan Province, China
inferred← citeshttps://doi.org/10.1051/ro/1994280303031openalex-snapshot
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
inferred← citeshttps://doi.org/10.1051/ro/2018048openalex-snapshot
Application of the “descent with mutations” metaheuristic to a clique partitioning problem
inferred← citeshttps://doi.org/10.1080/136588198241734openalex-snapshot
Cluster discovery techniques for exploratory spatial data analysis
inferred← citeshttps://doi.org/10.1093/esr/jcs067openalex-snapshot
The Structure and the Content of Criminal Connections: The Russian Mafia in Italy
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941893openalex-snapshot
CLIQUE: Clustering based on density on web usage data: Experiments and test results
inferred← citeshttps://doi.org/10.1109/jsac.2009.090606openalex-snapshot
Is rate adaptation beneficial for inter-session network coding?
inferred← citeshttps://doi.org/10.1109/milcom.2008.4753085openalex-snapshot
Is rate adaptation beneficial for inter-session network coding?
inferred← citeshttps://doi.org/10.1109/qce60285.2024.10247openalex-snapshot
Towards Less Greedy Quantum Coalition Structure Generation in Induced Subgraph Games
inferred← citeshttps://doi.org/10.1109/rivf.2007.369132openalex-snapshot
Application of the "descent with mutations" metaheuristic to a clique partitioning problem
inferred← citeshttps://doi.org/10.1109/tai.2003.1250220openalex-snapshot
Integrating microarray data by consensus clustering
inferred← citeshttps://doi.org/10.1109/tcyb.2021.3051243openalex-snapshot
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1109/tnet.2018.2865464openalex-snapshot
Rural Broadband Access via Clustered Collaborative Communication
inferred← citeshttps://doi.org/10.1111/bmsp.12386openalex-snapshot
Integer programming in psychology: A review and directions for future research
inferred← citeshttps://doi.org/10.1134/s1064226915120177openalex-snapshot
Combinatorial clustering: Literature review, methods, examples
inferred← citeshttps://doi.org/10.1134/s1064226922140042openalex-snapshot
On the Clique Partitioning of a Graph
inferred← citeshttps://doi.org/10.1142/s0218213004001867openalex-snapshot
INTEGRATING MICROARRAY DATA BY CONSENSUS CLUSTERING
inferred← citeshttps://doi.org/10.1155/2014/353101openalex-snapshot
An Iterated Tabu Search Approach for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1177/0895904817723739openalex-snapshot
Common Core State Standards on Twitter: Public Sentiment and Opinion Leaders
inferred← citeshttps://doi.org/10.1177/1469540514536191openalex-snapshot
Networks of practices in critical consumption
inferred← citeshttps://doi.org/10.1287/ijoc.9.1.30openalex-snapshot
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
inferred← citeshttps://doi.org/10.13088/jiis.2013.19.2.101openalex-snapshot
A Study on Recent Research Trend in Management of Technology Using Keywords Network Analysis
inferred← citeshttps://doi.org/10.1590/s0034-75902007000300002openalex-snapshot
Tropicália: manobras estratégicas em redes de músicos
inferred← citeshttps://doi.org/10.1613/jair.1.13382openalex-snapshot
Improving Simulated Annealing for Clique Partitioning Problems
inferred← citeshttps://doi.org/10.18130/v37553openalex-snapshot
Social Network Analysis of Self and Peer Perceptions of Personality Pathology
inferred← citeshttps://doi.org/10.33581/2520-6508-2019-3-93-104openalex-snapshot
Improved upper bounds in clique partitioning problem
inferred← citeshttps://doi.org/10.3389/fmars.2024.1355481openalex-snapshot
Detecting communities at high-risk of IUU fishing: networks of shadow encounters in Area 81 of the Western Central Pacific
inferred← citeshttps://doi.org/10.3390/su131810000openalex-snapshot
Collaborative Governance Networks: A Case Study of Argentina’s Forest Law
inferred← citeshttps://doi.org/10.4000/msh.11774openalex-snapshot
Consensus theories. An oriented survey
inferred← citeshttps://doi.org/10.4000/msh.12188openalex-snapshot
Sur le consensus en catégorisation libre
inferred← citeshttps://doi.org/10.4000/msh.12208openalex-snapshot
Publications de Jean-Pierre Barthélemy
inferred← citeshttps://doi.org/10.4000/msh.12209openalex-snapshot
NP-hardness of the computation of a median equivalence relation in classification (Régnier problem)
inferred← citeshttps://doi.org/10.4018/978-1-61350-086-6.ch012openalex-snapshot
Hybrid Heuristics for the Territory Alignment Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.601.470openalex-snapshot
A Graph Partition Model for Cross Docking Schedule Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05627openalex-snapshot
Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.5120/ijca2019918938openalex-snapshot
Enhancing the Efficiency of moving Video Camera Vigilance using DBSCAN
inferred← citeshttps://doi.org/10.7179/psri_2016.28.04openalex-snapshot
Difusión de la innovación: la red social y el enfoque de aprendizaje organizativo para la gobernanza de un equipo de liderazgo de todo el distrito
inferred← citeshttps://doi.org/10.7838/jsebs.2012.17.2.129openalex-snapshot
Understanding the Performance of Collaborative Filtering Recommendation through Social Network Analysis
inferred← citeshttps://doi.org/10.7916/d8gm8fcxopenalex-snapshot
Simulating Network Structure, Layering Multi-layer Network System and Developing Network Block Configuration Model to Understand and Improve Energy Conservation in Residential Buildings
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.