J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In Advances in computational and stochastic optimization, logic programming, and heuristic studies, pages 1-30. Kluwer, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....unary predicates, and the addition of unary predicates does not change the treewidth of a structure. The result now follows immediately from Theorem 5. A different polynomial time backtrack free algorithm for CSP(T ( F( is known in the literature. Specifically, Section 1.4. 2 of Hooker [Hoo97]) contains a description of a zero step lookahead algorithm for constructing a homomorphism from A to B, where A is of treewidth k. This algorithm is based on Freuder s [Fre90] result that the treewidth of a graph coincides with its induced width. Unlike the backtrackfree algorithm based on ....

J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In Advances in computational and stochastic optimization, logic programming, and heuristic studies, pages 1--30. Kluwer, 1997.

....like arc consistency generate implied unary constraints. As a second example, nogood recording techniques [ 2 ] generate implied constraints from dead ends in search. In the area of operations research cutting planes are highly effective at strengthening linear relaxations and at pruning search [ 7 ] . Cutting planes are linear inequalities implied by the original set of inequalities. Hooker has shown [ 7 ] that resolution (and its generalisation to multi valued clauses) is a general method for generating cutting planes analogous to more traditional techniques like Chv atal s method. As a ....

....[ 2 ] generate implied constraints from dead ends in search. In the area of operations research cutting planes are highly effective at strengthening linear relaxations and at pruning search [ 7 ] Cutting planes are linear inequalities implied by the original set of inequalities. Hooker has shown [ 7 ] that resolution (and its generalisation to multi valued clauses) is a general method for generating cutting planes analogous to more traditional techniques like Chv atal s method. As a final example, in propositional satisfiability inference techniques such as directional resolution [ 3 ] can be ....

J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In D. L. Woodruf, editor, Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pages 1--30. Kluwer, 1997.

....on the other. To date, numerous MP techniques have been integrated into CP tools (simplex algorithms being used in all commercial CP tools for solving linear constraints over reals) but the MP community has only recently started to recognise the possible impact the use of CP techniques might have [8], most importantly regarding the methods for generating cuts in the branch and bound search. Taking this idea a step further, the objective of the present research is to integrate closely a CP(FD) solver and a commercial MIP software in order to exploit the effects of constraint propagation within ....

J.N. Hooker. Constraint Satisfaction Methods for Generating Valid Cuts. In D.L. Woodruff, editor, Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pages 1--30. Kluwer, Boston, 1998.

....related theories of search. One, which comprises much of the constraint satisfaction field, examines factors that govern the amount of backtracking necessary to complete a branching search. It is fully explained in Tsang s text [141] and summarized from a mathematical programming perspective in [84]. Another explores the idea of constraint based search, which combines inference and branching. It is exposited in Chapter 18 of [85] 3.2.1 Constraint Satisfaction The fundamental concept of constraint satisfaction is that of a consistent constraint set, which is not the same as a satisfiable ....

Hooker, J. N., Constraint satisfaction methods for generating valid cuts, in D. L. Woodru#, ed., Advances in Computational and Stochasic Optimization, Logic Programming and Heuristic Search, Kluwer (Dordrecht, 1997) 1--30.

....the word may suggest, but is roughly analogous to integrality in a polyhedral setting, because a totally consistent constraint set can be solved without backtracking. There is no space to present this theory here, but an expository development written for mathematical programmers is available in [36]. In the context of MLLP, generating valid logic constraints has another advantage. It may be possible to define relaxations for the logic constraints in the continuous part of the model, thereby strengthening the overall relaxation. The discussion here will be limited to three types of inference ....

Hooker, J. N., Constraint satisfaction methods for generating valid cuts, available at http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html (1997).

No context found.

J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In Advances in computational and stochastic optimization, logic programming, and heuristic studies, pages 1-30. Kluwer, 1997.

No context found.

J.N. Hooker. Constraint satisfaction methods for generating valid cuts. In Advances in computational and stochastic optimization, logic programming, and heuristic studies, pages 1--30. Kluwer, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC