Hybrid algorithms in constraint programming

Authors:
Mark Wallace
Affiliations:
Monash University, Faculty of Information Technology, Clayton, Vic., Australia
Venue:
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Year:
2006

Citing 29
Cited 1

Weak-commitment search for solving constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solution reuse in dynamic constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast taboo search algorithm for the job shop problem

Management Science
Variable neighborhood search

Computers and Operations Research
A gentle introduction to NUMERICA

Artificial Intelligence - Special issue: artificial intelligence 40 years later
Mixed logical-linear programming

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A Lagrangian reconstruction of GENET

Artificial Intelligence
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem

Annals of Mathematics and Artificial Intelligence
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

Constraints
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems

Journal of Heuristics
A Constraint Programming Framework for Local Search Methods

Journal of Heuristics
Heuristics for Large Constrained Vehicle Routing Problems

Journal of Heuristics
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems

Journal of Global Optimization
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Local Search with Constraint Propagation and Conflict-Based Heuristics

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Local Probing Applied to Scheduling

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
Scheduling a Major College Basketball Conference--Revisited

Operations Research
Combining local and global search in a constraint programming environment

The Knowledge Engineering Review
A hybrid multicommodity routing algorithm for traffic engineering

Networks
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems

Transportation Science
Frontier search

Journal of the ACM (JACM)
A Hybrid Method for the Planning and Scheduling

Constraints
Constraint-Based Local Search

Constraint-Based Local Search
Constraint Logic Programming using Eclipse

Constraint Logic Programming using Eclipse
Modeling choices in quasigroup completion: SAT vs. CSP

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Redundant modeling in permutation weighted constraint satisfaction problems

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys hybrid algorithms from a constraint programming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques used in combination with search by repair.