Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
From MaRDI portal
Publication:1273655
DOI10.1023/A:1009646528813zbMath0917.68162OpenAlexW1605165687MaRDI QIDQ1273655
Publication date: 8 August 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009646528813
Related Items (14)
Subgraph extraction and metaheuristics for the maximum clique problem ⋮ Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder ⋮ On complexity of optimal recombination for flowshop scheduling problems ⋮ A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Variable neighborhood search for the maximum clique ⋮ A hybrid heuristic for the maximum clique problem ⋮ Distributed Load Identification for Uncertain Structure Based on LHS-GA and Improved L-Curve Method ⋮ Hitting times of local and global optima in genetic algorithms with very high selection pressure
Uses Software
This page was built for publication: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
