Meta-heuristics and artificial intelligence

DOI10.1007/978-3-030-06167-8_2MaRDI QIDQ6602249zbMATH OpenFDO

Authors Jin-Kao Hao, Christine Solnon

Publication date 11 September 2024

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)

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

Cites work

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

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)