On the public citation graph
Solving the maximum clique problem using a tabu search approach
0 signed · 131 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-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01415983openalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
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.1007/bf02248731openalex-snapshot
Clique detection for nondirected graphs: Two new algorithms
inferredcites →https://doi.org/10.1007/bf02579304openalex-snapshot
Expose-and-merge exploration and the chromatic number of a random graph
inferredcites →https://doi.org/10.1016/0020-0190(88)90065-8openalex-snapshot
On generating all maximal independent sets
inferredcites →https://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
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/0305-0548(90)90048-copenalex-snapshot
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
inferredcites →https://doi.org/10.1016/0305-0548(92)90067-fopenalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90383-4openalex-snapshot
A new heuristic method for the flow shop sequencing problem
inferredcites →https://doi.org/10.1016/0898-1221(83)90115-3openalex-snapshot
A new backtracking algorithm for generating the family of maximal independent sets of a graph
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1051/ro/197509v100051openalex-snapshot
De l'utilisation de la notion de clique (sous-graphe complet symétrique) en matière de typologie de populations
inferredcites →https://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferredcites →https://doi.org/10.1080/00207169008803851openalex-snapshot
A global optimization approach for solving the maximum clique problem
inferredcites →https://doi.org/10.1080/00207169108803967openalex-snapshot
An algorithm for finding a maximum weighted independent set in an arbitrary graph
inferredcites →https://doi.org/10.1109/tcad.1986.1270190openalex-snapshot
Simulated Annealing Without Rejected Moves
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1137/0220012openalex-snapshot
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
inferredcites →https://doi.org/10.1137/1012125openalex-snapshot
A Survey of Progress in Graph Theory in the Soviet Union
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0146openalex-snapshot
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/net.22246openalex-snapshot
Finding conserved low‐diameter subgraphs in social and biological networks
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_2openalex-snapshot
An Introduction to Tabu Search
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_195openalex-snapshot
Graph coloring; Greedy randomized adaptive search procedures; Heuristics for maximum clique and independent set; Replicator dynamics in combinatorial optimization HEURISTICS FOR MAXIMUM CLIQUE AND INDEPENDENT SET
inferred← citeshttps://doi.org/10.1007/0-387-27744-7_14openalex-snapshot
Case-Based Initialisation of Metaheuristics for Examination Timetabling
inferred← citeshttps://doi.org/10.1007/11593577_15openalex-snapshot
A Novel Similarity Measure for Heuristic Selection in Examination Timetabling
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_264openalex-snapshot
Heuristics for Maximum Clique and Independent Set
inferred← citeshttps://doi.org/10.1007/978-1-4614-0857-4_5openalex-snapshot
Clique Relaxation Models in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-8588-9_10openalex-snapshot
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_11openalex-snapshot
A Scatter Search Algorithm for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-1openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-2openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_14openalex-snapshot
On Maximum Weight Clique Algorithms, and How They Are Evaluated
inferred← citeshttps://doi.org/10.1007/978-3-540-68020-8_4openalex-snapshot
How and Why Pattern Recognition and Computer Vision Applications Use Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_4openalex-snapshot
Physician Scheduling in Emergency Rooms
inferred← citeshttps://doi.org/10.1007/978-3-642-01085-9_6openalex-snapshot
Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_22openalex-snapshot
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
inferred← citeshttps://doi.org/10.1007/978-3-642-37198-1_21openalex-snapshot
Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search
inferred← citeshttps://doi.org/10.1007/bf02125454openalex-snapshot
Diversification strategies in tabu search algorithms for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf03167318openalex-snapshot
The Life Span Method — a new variant of local search —
inferred← citeshttps://doi.org/10.1007/s004530010074openalex-snapshot
Reactive Local Search for the Maximum Clique Problem1
inferred← citeshttps://doi.org/10.1007/s00607-012-0263-3openalex-snapshot
Finding large $$k$$ -clubs in undirected graphs
inferred← citeshttps://doi.org/10.1007/s10479-012-1124-3openalex-snapshot
Multi-neighborhood tabu search for the maximum weight clique problem
inferred← citeshttps://doi.org/10.1007/s10479-016-2161-0openalex-snapshot
Detecting robust cliques in graphs subject to uncertain edge failures
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/s10732-006-4295-8openalex-snapshot
A study of ACO capabilities for solving the maximum clique problem
inferred← citeshttps://doi.org/10.1007/s10878-010-9338-2openalex-snapshot
Combinatorial algorithms for the maximum k-plex problem
inferred← citeshttps://doi.org/10.1007/s10878-011-9437-8openalex-snapshot
An adaptive multistart tabu search approach to solve the maximum clique problem
inferred← citeshttps://doi.org/10.1007/s10878-012-9473-zopenalex-snapshot
Algorithms for the maximum k-club problem in graphs
inferred← citeshttps://doi.org/10.1016/0305-0548(93)e0023-mopenalex-snapshot
Genetic algorithms and tabu search: Hybrids for optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90014-0openalex-snapshot
A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90018-3openalex-snapshot
A study of diversification strategies for the quadratic assignment problem
inferred← citeshttps://doi.org/10.1016/j.cor.2005.10.008openalex-snapshot
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.012openalex-snapshot
Variable neighborhood search for the maximum clique
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.013openalex-snapshot
A branch-and-price algorithm for the robust graph coloring problem
inferred← citeshttps://doi.org/10.1016/j.datak.2009.04.011openalex-snapshot
An approach for temporal analysis of email data based on segmentation
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.10.027openalex-snapshot
Identifying large robust network clusters via new compact formulations of maximum k-club problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.064openalex-snapshot
A review on algorithms for maximum clique problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.05.020openalex-snapshot
On biconnected and fragile subgraphs of low diameter
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.12.006openalex-snapshot
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.014openalex-snapshot
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
inferred← citeshttps://doi.org/10.1016/j.eswa.2006.06.017openalex-snapshot
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
inferred← citeshttps://doi.org/10.1016/j.jtbi.2015.10.030openalex-snapshot
Algorithmic height compression of unordered trees
inferred← citeshttps://doi.org/10.1016/j.ress.2007.06.004openalex-snapshot
Tabu search for the redundancy allocation problem of homogenous series–parallel multi-state systems
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00257-9openalex-snapshot
Bounds for the frequency assignment problem
inferred← citeshttps://doi.org/10.1016/s0031-3203(99)00090-4openalex-snapshot
A tabu-search-based heuristic for clustering
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00053-8openalex-snapshot
Finding all k-cliques in k-partite graphs, an application in textile engineering
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/s0305-0548(99)00045-3openalex-snapshot
A hybrid heuristic to solve a task allocation problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00047-7openalex-snapshot
Heuristics for finding k-clubs in an undirected graph
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00133-3openalex-snapshot
An exact algorithm for the maximum k-club problem in an undirected graph
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00832-9openalex-snapshot
A variable neighborhood search for graph coloring
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00175-0openalex-snapshot
Facets for node packing
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00097-0openalex-snapshot
Constructing a course schedule by solving a series of assignment type problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)80006-4openalex-snapshot
Improving heuristics for the frequency assignment problem
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.008openalex-snapshot
Optimization Methods in Logic
inferred← citeshttps://doi.org/10.1023/a:1009646528813openalex-snapshot
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems
inferred← citeshttps://doi.org/10.1023/a:1014444525059openalex-snapshot
An Optimal Strategy for the Constrained Cycle Cover Problem
inferred← citeshttps://doi.org/10.1051/ro/1996300403731openalex-snapshot
Algorithmes génétiques hybrides pour l'optimisation combinatoire
inferred← citeshttps://doi.org/10.1051/ro/1997310201331openalex-snapshot
Fondements et applications des méthodes de recherche avec tabous
inferred← citeshttps://doi.org/10.1057/jors.2013.58openalex-snapshot
A multi-objective evolutionary algorithm for facility dispersion under conditions of spatial uncertainty
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000175openalex-snapshot
Bee Colony Optimization Approach to Solving the Anticovering Location Problem
inferred← citeshttps://doi.org/10.1080/00207540600693713openalex-snapshot
Mining relevant information on the Web: a clique-based approach
inferred← citeshttps://doi.org/10.1088/2058-9565/ab8504openalex-snapshot
Applications of near-term photonic quantum computers: software and algorithms
inferred← citeshttps://doi.org/10.1093/oso/9780198503149.003.0005openalex-snapshot
Channel Assignment on Infinite Sets Under Frequency—Distance Constraints
inferred← citeshttps://doi.org/10.1109/icnc.2010.5583351openalex-snapshot
An improved ACO metaheuristic for solving the MCP
inferred← citeshttps://doi.org/10.1109/ispan.2000.900254openalex-snapshot
A parallel tabu search and its hybridization with genetic algorithms
inferred← citeshttps://doi.org/10.1109/smcia.2005.1466955openalex-snapshot
A novel evolutionary algorithm for MCP using MEC
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.915645openalex-snapshot
An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding
inferred← citeshttps://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferred← citeshttps://doi.org/10.1155/2014/523634openalex-snapshot
Protein-Protein Interactions Prediction Based on Iterative Clique Extension with Gene Ontology Filtering
inferred← citeshttps://doi.org/10.11606/d.55.2009.tde-08062009-105244openalex-snapshot
Uma estratégia para a minimização de máquinas de estados finitos parciais
inferred← citeshttps://doi.org/10.1287/ijoc.10.4.438openalex-snapshot
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
inferred← citeshttps://doi.org/10.1287/ijoc.2014.0618openalex-snapshot
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1231openalex-snapshot
On Fault-Tolerant Low-Diameter Clusters in Graphs
inferred← citeshttps://doi.org/10.14279/depositonce-3922openalex-snapshot
Exploring parameter spaces in coping with computational intractability
inferred← citeshttps://doi.org/10.14288/1.0051985openalex-snapshot
A parallel workflow for online correlation and clique-finding : with applications to finance
inferred← citeshttps://doi.org/10.3390/a6040726openalex-snapshot
An Efficient Local Search for the Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.3390/math12182850openalex-snapshot
Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.4018/978-1-4666-1891-6.ch001openalex-snapshot
Graph Matching Techniques for Computer Vision
inferred← citeshttps://doi.org/10.4018/978-1-4666-3994-2.ch021openalex-snapshot
Graph Matching Techniques for Computer Vision
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0748openalex-snapshot
A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1403.5111openalex-snapshot
On Solving the Maximum $k$-club Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2001.09644openalex-snapshot
The maximum $k$-colorable subgraph problem and related problems
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06639openalex-snapshot
Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94749openalex-snapshot
Multi-objective optimization in graphical models
inferred← citeshttps://doi.org/10.7150/ijbs.8430openalex-snapshot
Predicting Disease-Related Proteins Based on Clique Backbone in Protein-Protein Interaction Network
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.