7 search results - page 2 / 2 » Valid inequalities and branch-and-cut for the clique pricing... |
MP
2006
13 years 5 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
IPCO
2008
13 years 6 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...