A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stable Set Problem
[chapter]
2003
Lecture Notes in Computer Science
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable domain values, based on the solution of a semidefinite relaxation. Using this ranking, we generate the most promising subproblems first, by exploring a search tree using a limited discrepancy strategy. Then the subproblems are being solved using a constraint
doi:10.1007/978-3-540-45193-8_28
fatcat:yhpdj4gc4nflxbxqd5sltf2isi