Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming

DMCA

Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Hadrien Cambazard , Narendra Jussien

Venue:	Constraints
Citations:	18 - 2 self

BibTeX

@ARTICLE{Cambazard_identifyingand,
    author = {Hadrien Cambazard and Narendra Jussien},
    title = {Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming},
    journal = {Constraints},
    year = {},
    pages = {2006}
}

OpenURL

Abstract

Abstract. Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. The next step is to design algorithms that adaptively integrate that kind of information during search. We claim in this paper, inspired by previous work on impact-based search strategies for constraint programming, that using an explanation-based constraint solver may lead to collect invaluable information on the intimate dynamically revealed and static structures of a problem instance. Moreover, we discuss how dedicated OR solving strategies (such as Benders decomposition) could be adapted to constraint programming when specific relationships between variables are exhibited. 1.

Keyphrases

next step inherent complexity key step problem instance specific relationship static structure explanation-based constraint solver constraint programming relaxation strategy impact-based search strategy efficient search heuristic several operation research previous work combinatorial problem bender decomposition invaluable information

DMCA