Optimized Crossover for the Independent Set Problem

Cited In (21)

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Humanitarian logistics planning for natural disaster response with Bayesian information updates
A greedy genetic algorithm for the quadratic assignment problem
Minimizing energies with hierarchical costs
Title not available (Why is that?)
Hybridizations of evolutionary algorithms with large neighborhood search
Combining metaheuristics with mathematical programming, constraint programming and machine learning
Optimised crossover genetic algorithm for capacitated vehicle routing problem
A genetic approach for efficient outlier detection in projected space
An efficient local search framework for the minimum weighted vertex cover problem
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
The robust set covering problem with interval data
A hybrid heuristic for the maximum clique problem
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
Variable neighborhood search for the maximum clique
Partition Crossover for Pseudo-Boolean Optimization
Digital data networks design using genetic algorithms
Hitting times of local and global optima in genetic algorithms with very high selection pressure
Combining metaheuristics with mathematical programming, constraint programming and machine learning
A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network

This page was built for publication: Optimized Crossover for the Independent Set Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367248)