Meta-heuristics and artificial intelligence
From MaRDI portal
Publication:6602249
DOI10.1007/978-3-030-06167-8_2zbMATH Open1547.68709MaRDI QIDQ6602249
Publication date: 11 September 2024
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The configurable SAT solver challenge (CSSC)
- A multiple search operator heuristic for the max-k-cut problem
- Model-based search for combinatorial optimization: A critical survey
- A constraint-based local search backend for MiniZinc
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A probabilistic heuristic for a computationally difficult set covering problem
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Local search with constraint propagation and conflict-based heuristics
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Multi-neighborhood tabu search for the maximum weight clique problem
- A general approach for constraint solving by local search
- Hybrid evolutionary algorithms for graph coloring
- Breakout local search for the quadratic assignment problem
- Adaptive tabu search for course timetabling
- An adaptive memory algorithm for the \(k\)-coloring problem
- A Metaheuristic Approach for the Vertex Coloring Problem
- Neighbourhood Clause Weight Redistribution in Local Search for SAT
- Applications of the DM‐GRASP heuristic: a survey
- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
- New methods to color the vertices of a graph
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- Evolutionary Computation in Combinatorial Optimization
- Variable neighborhood search: Principles and applications
- Reactive local search for the maximum clique problem
- Adaptive, restart, randomized greedy heuristics for maximum clique
This page was built for publication: Meta-heuristics and artificial intelligence
