On the public citation graph

A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy

0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.21791openalex-snapshot
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
inferredcites →https://doi.org/10.1007/3-540-45995-2_51openalex-snapshot
Massive Quasi-Clique Detection
inferredcites →https://doi.org/10.1007/978-3-540-92695-5_4openalex-snapshot
On Effectively Finding Maximal Quasi-cliques in Graphs
inferredcites →https://doi.org/10.1007/978-3-662-44320-0_4openalex-snapshot
An Analysis of Parameters of irace
inferredcites →https://doi.org/10.1007/s10479-012-1242-yopenalex-snapshot
A branch-and-bound approach for maximum quasi-cliques
inferredcites →https://doi.org/10.1007/s10589-015-9804-yopenalex-snapshot
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
inferredcites →https://doi.org/10.1007/s10732-010-9143-1openalex-snapshot
Biased random-key genetic algorithms for combinatorial optimization
inferredcites →https://doi.org/10.1007/s10898-010-9608-7openalex-snapshot
A biased random-key genetic algorithm for routing and wavelength assignment
inferredcites →https://doi.org/10.1007/s11590-006-0031-4openalex-snapshot
TTT plots: a perl program to create time-to-target plots
inferredcites →https://doi.org/10.1007/s13278-014-0228-yopenalex-snapshot
Coloring large complex networks
inferredcites →https://doi.org/10.1016/j.dam.2012.07.019openalex-snapshot
On the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.05.071openalex-snapshot
A biased random-key genetic algorithm for the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.orp.2016.09.002openalex-snapshot
The irace package: Iterated racing for automatic algorithm configuration
inferredcites →https://doi.org/10.1023/a:1015061802659openalex-snapshot
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
inferredcites →https://doi.org/10.1080/10556788.2014.890197openalex-snapshot
A C++application programming interface for biased random-key genetic algorithms
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1090/dimacs/026/17openalex-snapshot
An improved algorithm for exact graph coloring
inferredcites →https://doi.org/10.1111/itor.12178openalex-snapshot
A biased random‐key genetic algorithm for single‐round divisible load scheduling
inferredcites →https://doi.org/10.1111/itor.12429openalex-snapshot
A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
inferredcites →https://doi.org/10.1111/itor.12637openalex-snapshot
An exact algorithm for the maximum quasi‐clique problem
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2908961.2926996openalex-snapshot
Biased Ranom-Key Genetic Algorithms
inferredcites →https://doi.org/10.1287/ijoc.6.2.154openalex-snapshot
Genetic Algorithms and Random Keys for Sequencing and Optimization
inferredcites →https://doi.org/10.1609/aaai.v29i1.9277openalex-snapshot
The Network Data Repository with Interactive Graph Analytics and Visualization
inferredcites →https://doi.org/10.21236/ada293985openalex-snapshot
On the Virtues of Parameterized Uniform Crossover,
inferredcites →https://doi.org/10.48550/arxiv.1301.7383openalex-snapshot
Evaluating Las Vegas Algorithms - Pitfalls and Remedies

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-3-032-00385-0_30openalex-snapshot
Random-Key Genetic Algorithms: Principles and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_30-2openalex-snapshot
Random-Key Genetic Algorithms: Principles and Applications
inferred← citeshttps://doi.org/10.1007/s10479-023-05609-7openalex-snapshot
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s11704-024-40238-8openalex-snapshot
Improving local search algorithms for clique relaxation problems via group driven initialization
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.030openalex-snapshot
Biased random-key genetic algorithms: A review
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.018openalex-snapshot
Solving the Multiobjective Quasi-clique 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.1049/ell2.12685openalex-snapshot
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
inferred← citeshttps://doi.org/10.1051/ro/2023081openalex-snapshot
A biased random-key genetic algorithm for the chordal completion problem
inferred← citeshttps://doi.org/10.1088/1742-6596/2833/1/012008openalex-snapshot
Design and Implementation of TDMA Scheduling Based on BRKGA
inferred← citeshttps://doi.org/10.1111/itor.13299openalex-snapshot
MIP formulations for induced graph optimization problems: a tutorial
inferred← citeshttps://doi.org/10.1111/itor.70184openalex-snapshot
Ensuring connectedness for the maximum quasi‐clique and densest k ‐subgraph problems
inferred← citeshttps://doi.org/10.1145/3461598.3461603openalex-snapshot
Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy
inferred← citeshttps://doi.org/10.1145/3589334.3645374openalex-snapshot
A Similarity-based Approach for Efficient Large Quasi-clique Detection
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17455openalex-snapshot
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem
inferred← citeshttps://doi.org/10.7717/peerj-cs.2173openalex-snapshot
An optimization algorithm for maximum quasi-clique problem based on information feedback model
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.