Optimized Crossover for the Independent Set Problem

DOI10.1287/OPRE.45.2.226MaRDI QIDQ4367248zbMATH OpenOpenAlexFDO

Authors Charu C. Aggarwal, James B. Orlin, Ray P. Tai

Publication date 25 November 1997

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.45.2.226

zbMATH Keywords

genetic algorithmsheuristicsindependent set problemknowledge-based crossover mechanisms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 759408
• scientific article; zbMATH DE number 890674
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems

Cited in

(24)

• Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
• A greedy genetic algorithm for the quadratic assignment problem
• Digital data networks design using genetic algorithms
• Minimizing energies with hierarchical costs
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
• An efficient local search framework for the minimum weighted vertex cover problem
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
• Humanitarian logistics planning for natural disaster response with Bayesian information updates
• A genetic approach for efficient outlier detection in projected space
• A hybrid heuristic for the maximum clique problem
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Partition Crossover for Pseudo-Boolean Optimization
• scientific article; zbMATH DE number 5316003 (Why is no real title available?)
• The robust set covering problem with interval data
• Optimised crossover genetic algorithm for capacitated vehicle routing problem
• scientific article; zbMATH DE number 759408 (Why is no real title available?)
• 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
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• Hybridizations of evolutionary algorithms with large neighborhood search
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource
• Contemporary approaches in matheuristics an updated survey
• Variable neighborhood search for the maximum clique

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)