Improved local search for CP toolkits

DOI10.1023/A:1021188818613MaRDI QIDQ1854752zbMATH OpenOpenAlexFDO

Authors Paul Shaw, Bruno De Backer, Vincent Furnon

Publication date 27 January 2003

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021188818613

zbMATH Keywords

local searchhybrid methodsconstraint progamming

Mathematics Subject Classification ID

Search theory (90B40) Nonlinear programming (90C30)

Recommendations

• Local Search and Constraint Programming
• A constraint programming framework for local search methods
• Constraint Programming and Local Search Hybrids
• scientific article; zbMATH DE number 2084730
• scientific article; zbMATH DE number 2159472

Cited in

(13)

• Principles and Practice of Constraint Programming – CP 2004
• A constraint programming framework for local search methods
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Contraint-based combinators for local search
• Local branching in a constraint programming framework
• scientific article; zbMATH DE number 2084730 (Why is no real title available?)
• Local Search and Constraint Programming
• Using Local Search for Guiding Enumeration in Constraint Solving
• scientific article; zbMATH DE number 2159472 (Why is no real title available?)
• Combining local and global search in a constraint programming environment
• Maintaining longest paths incrementally
• Control abstractions for local search
• Enhancing the performance of constraint programming through the introduction of linear programming

This page was built for publication: Improved local search for CP toolkits

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