Oct 5, 2015 · In this paper, we reformulate the problem as a binary quadratic constrained program for which the continuous relaxation is not necessarily convex.

Numerical results show that an improvement of Sherali–Smith's linearization outperforms largely the binary SOCP program and the classical linearization when ...

Stochastic graph partitioning: quadratic versus SOCP formulations. Abstract We consider a variant of the graph partitioning problem involving knapsack ...

Stochastic graph partitioning: quadratic versus SOCP formulations. Article 05 October 2015. Parameterized Algorithms for Stochastic Steiner Tree Problems.

Sirdey (2016) "Stochastic graph partitioning: quadratic versus SOCP formulations", Optimization Letters, Vol 10, No 7, pp. 1505-1518. D.P. Nguyen, M. Minoux ...

Apr 25, 2024 · Stochastic graph partitioning: quadratic versus SOCP formulations. Optim. Lett. 10(7): 1505-1518 (2016); 2014. [c1]. view. electronic edition ...

Minoux, V.H. Nguyen, T.H. Nguyen, and R. Sirdey. Stochas- tic graph partitioning: Quadratic versus SOCP formulations. Optimization. Letters, p.1 - p.14, 2015 ...

Numerical results show that an improvement of Sherali-Smith's linearization outperforms largely the binary SOCP program and the classical linearization when ...

Sirdey : “Stochastic graph partitioning: quadratic versus SOCP formulations”, Optimization Letters, vol. 10 (7), pp. 1505–1518, (Springer Verlag) (2016); V.

Stochastic graph partitioning: quadratic versus SOCP formulations.Optim. Lett. 10(7): 1505-1518 (2016); 2015. paper. [j50]. Q1. Céline Gicquel, Michel Minoux