Multiple populations guided by the constraint-graph for CSP

MaRDI QIDQ4471901zbMATH OpenFDO

Authors Arturo Núñez, M.-C. Riff

Publication date 30 July 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1952/19520457.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A population and interval constraint propagation algorithm
• Artificial Intelligence: Methodology, Systems, and Applications
• scientific article; zbMATH DE number 4029297
• Constraint programming techniques for solving problems on graphs
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
• The clique problem with multiple-choice constraints under a cycle-free dependency graph
• scientific article; zbMATH DE number 1094771

Cited in

(3)

• Evaluating migration strategies for an evolutionary algorithm based on the constraint-graph that solves CSP
• Population migration: A meta-heuristics for stochastic approaches to constraint satisfaction problems
• A multiple-population evolutionary approach to gate matrix layout

This page was built for publication: Multiple populations guided by the constraint-graph for CSP

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