A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
biased random-key genetic algorithmscombinatorial optimizationmetaheuristicsnetwork clusteringquasi-clique partitioningquasi-cliques
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A biased random-key genetic algorithm for the set orienteering problem
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- A community detection algorithm based on graph compression for large-scale social networks
- A review on algorithms for maximum clique problems
- An analysis of variance test for normality (complete samples)
- An exact algorithm for the maximum quasi‐clique problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Compact structure for sparse undirected graphs based on a clique graph partition
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Finding influential communities in networks with multiple influence types
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- LP-based dual bounds for the maximum quasi-clique problem
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- MIP formulations for induced graph optimization problems: a tutorial
- New formulations and branch-and-cut procedures for the longest induced path problem
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- On exact solution approaches for the longest induced path problem
- On the maximum quasi-clique problem
- The k-regular induced subgraph problem
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
This page was built for publication: A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945270)
