Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method Original Research Article

Alain Billionnet، نويسنده , , Sourour Elloumi، نويسنده , , Marie-Christine Plateau، نويسنده ,

روزنامه با شماره پیاپی سال 2009

13

1185

1197

Graph bisection , Semidefinite programming , Task allocation , Experiments , Densest kk-subgraph , Quadratic 0-1 programming , convex quadratic programming

Discrete Applied Mathematics

2009

Discrete Applied Mathematics

887053