Login / Signup

Relaxations for Compiled Over-Constrained Problems.

Alexandre PapadopoulosBarry O'Sullivan
Published in: CP (2008)
Keyphrases
  • lower bound
  • linear programming
  • np hard
  • semidefinite
  • data sets
  • graph cuts
  • database
  • feature selection
  • decision making
  • case study
  • search algorithm