title: Maximum weighted clique in a large graph with high density
body: <p>Is there any software or an algorithm description that would let to find a maximum clique (approximately) with known number of vertices in a graph with ~17000 weighted vertices and ~75% density? I tried to use Cliquer but it's too slow (got me few days to get the result).</p>
  
  <p>A little about my problem, just in case - it's a sceduling problem, I have 18 time slots, each of them can be filled by different numbers of alternatives. Each variable represents one alternative for one slot. So, all alternatives for one slot are mutually exclusive and some alternatives for different slots are incompatible. If two alternatives are compatible than there is an edge between them. Weight reperesent the value of the alternative.</p>