A unified framework for partial and hybrid search methods in constraint programming

DOI10.1016/J.COR.2005.01.012zbMATH Open1086.90051OpenAlexW2142803997MaRDI QIDQ2489124FDOQ2489124

Authors: Simon de Givry, L. Jeannin 

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://hal.inrae.fr/hal-02659665/file/A%20unified%20framework%20for%20partial%20and%20hybrid%20search%20methods%20in%20constraint%20programming_1.pdf

Recommendations

• Constraint Programming and Local Search Hybrids
• A constraint programming framework for local search methods
• Hybrid Algorithms in Constraint Programming
• Combining local and global search in a constraint programming environment
• Logic Programming
• Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
• A new approach to partial constraint satisfaction problems

zbMATH Keywords

Combinatorial optimizationDesignConstraint programmingLanguagesSearch strategiesTree searchLarge neighborhood search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• SALSA: a language for search algorithms
• A Computational Study of the Job-Shop Scheduling Problem
• CLAIRE: combining sets, search and rules to better express algorithms
• Localizer
• Real-time heuristic search
• Variable neighborhood search
• Algorithm portfolios
• Using constraint-based operators to solve the vehicle routing problem with time windows
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood decomposition search
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• Combining VNS with constraint programming for solving anytime optimization problems
• Search and strategies in OPL
• Solving various weighted matching problems with constraints
• A constraint programming framework for local search methods
• Heuristics for large constrained vehicle routing problems
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Phase transitions and the search problem
• A decomposition-based implementation of search strategies
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• The DeltaUp constraint solver: Minimizing the number of method selections in DeltaBlue
• Valued constraint satisfaction problems
• Nondeterministic control for hybrid search
• MCS---a new algorithm for multicriteria optimisation in constraint programming

Uses Software

• CLAIRE
• Choco
• BL data set
• Localizer
• OPL
• ToOLS

This page was built for publication: A unified framework for partial and hybrid search methods in constraint programming

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