J.N. Hooker, G. Ottoson, E.S. Thorsteinsson, and H.-J. Kim. A sheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review, April 1999. Special issue on AI/OR.  Home/Search   Document Not in Database   Summary   Related Articles

....as well as the close integration of CLP and MP in general, is still under research. 2.3 A motivating example This section presents an example that motivates the combination of a CLP solution approach and a MP solution approach. This example is an adapted version of the example presented in [HOTK99] Consider the following optimization problem: 2.10) This minimization problem will be solved by a constraint logic programming solution approach, by an integer programming approach and by a combination of the two. 2.3.1 CLP solution approach In a CLP approach, the problem ....

....D 1 3, 4, 5 , D 2 2, 3, 4, 5 . Constraint (2.11) is used with respect to x 3 : 8 4. The process continues until all branches have been evaluated and the optimum is found. 2.3.2 Integer programming solution approach In an IP approach, the problem (2. 10) can be stated as follows [HOTK99] Integer programming approach 26 (2.17) x k jk ) x k 5y jk 5 j 1, 2, 3 (2.20) x j integer j 1, 2, 3 (2.21) y jk The variables y jk (j k) are introduced to enforce the Alldifferent constraint, with y jk 1 when x j x k and y jk 0 when x j ....

J.N. Hooker, G. Ottoson, E.S. Thorsteinsson, and H.-J. Kim. A sheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review, April 1999. Special issue on AI/OR.

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