1 paper · 1 filter
Daniel Porumbel
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polyno…