Using global constraints for local search

MaRDI QIDQ2751576zbMATH OpenFDO

Authors Alexander Nareyek

Publication date 21 October 2001

zbMATH Keywords

local searchglobal constraintsjob-shop scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Local Search and Constraint Programming
• Combining local and global search in a constraint programming environment
• A general approach for constraint solving by local search
• Using Local Search for Guiding Enumeration in Constraint Solving
• scientific article; zbMATH DE number 2083802

Cited in

(7)

• scientific article; zbMATH DE number 2083802 (Why is no real title available?)
• Models for global constraint applications
• Revisiting constraint-directed search
• A general approach for constraint solving by local search
• Using Local Search for Guiding Enumeration in Constraint Solving
• Generic incremental algorithms for local search
• Generic support for precomputation-based global routing constraints in local search optimization

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: Using global constraints for local search

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