A framework for constructing complete algorithms based on local search

MaRDI QIDQ5435008zbMATH OpenFDO

Authors Olli Kamarainen, Hani El-Sakkout

Publication date 14 January 2008

zbMATH Keywords

hybrid algorithmsLocal searchresource constrained schedulingbacktrack search

Mathematics Subject Classification ID

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

Recommendations

• Combining the scalability of local search with the pruning techniques of systematic search
• Local Search and Constraint Programming
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A constraint programming framework for local search methods
• Local search with constraint propagation and conflict-based heuristics

Cited in

(2)

• scientific article; zbMATH DE number 1975618 (Why is no real title available?)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Describes a project that uses

Uses Software

• PSICO

This page was built for publication: A framework for constructing complete algorithms based on local search

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