Search technique in ECLiPSe?

From: Sirirat Muenvanichakul <>
Date: Thu 08 Jul 2004 04:58:46 AM GMT
Message-id: <>
I'm working on the permutation problem as quadratic assignmnet problem, which is in the sense seeking an optimal permutation of objects. I applied the idea with the "all-different" global constraint, which requires that the solution be a permutation. 

I used the "fd" search procedure "labeling" in Eclipse and as I know, the search method of Eclipse is depth-first search and backtracking.

At each node of the search tree algorithm, it may executes a four-step procedure: inference, solution of the relaxation, completion of the solution, and branching. 
Also, each step can be applied by several types of logic processing or technique. 
For example, constraint generation, domain reduction, or cutting plane (etc.) are the techniques for inference step.
What are techniques of search applied in Eclipse?  
What suggestion if I would improve the quality of search technique in Eclipse? 



Sirirat Muenvanichakul 
Olin 604, Tel. 368 4463
Received on Thu Jul 08 06:35:57 2004

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:29 PM GMT GMT