Constraint sequence solving for VLSI design

For VLSI design which have large collection of objects to be constrained, clear sequence of execution of constraints is important using constraint-satisfaction method for proper execution to avoid constraint loop at algorithmic level. The objective of this paper is relaxation based constraint sequence solving technique applied to the backtrack step of backtrack search solver, with the goal of increasing the ability of the solver to search different parts of the search space. The experimental results are promising, and motivate the integration of relaxation based constraint sequence solving in state-of-the-art solvers.