Meta-heuristics and artificial intelligence

DOI10.1007/978-3-030-06167-8_2zbMATH Open1547.68709MaRDI QIDQ6602249FDOQ6602249

Authors: Jin-Kao Hao, Christine Solnon 

Publication date: 11 September 2024

Recommendations

• Handbook of metaheuristics
• Essays and surveys in metaheuristics. Selected papers of the Third Metaheuristics International Conference held in Angra dos Reis, Brazil, July 1999
• Hybrid metaheuristics: an introduction
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1857493

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Variable neighborhood search: Principles and applications
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Adaptive tabu search for course timetabling
• New methods to color the vertices of a graph
• Title not available (Why is that?)
• A probabilistic heuristic for a computationally difficult set covering problem
• Hybrid evolutionary algorithms for graph coloring
• Multi-neighborhood tabu search for the maximum weight clique problem
• Breakout local search for the quadratic assignment problem
• Reactive local search for the maximum clique problem
• An adaptive memory algorithm for the \(k\)-coloring problem
• A metaheuristic approach for the vertex coloring problem
• Applications of the DM‐GRASP heuristic: a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Title not available (Why is that?)
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• A general approach for constraint solving by local search
• Model-based search for combinatorial optimization: A critical survey
• Adaptive, restart, randomized greedy heuristics for maximum clique
• Theory and Applications of Satisfiability Testing
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• The configurable SAT solver challenge (CSSC)
• Principles and Practice of Constraint Programming – CP 2004
• A multiple search operator heuristic for the max-k-cut problem
• Local search with constraint propagation and conflict-based heuristics
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• A constraint-based local search backend for MiniZinc
• Title not available (Why is that?)
• Strong combination of ant colony optimization with constraint programming optimization
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Meta-heuristics and artificial intelligence

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