T. Achterberg and C. Raack, The MCF-separator -detecting and exploiting multi-commodity flows in MIPs, Mathematical Programming C, vol.2, pp.125-165, 2010.

G. Agarwal and D. Kempe, Modularity-maximizing network communities using mathematical programming, The European Physical Journal B, vol.66, pp.409-418, 2008.

E. Balas and C. S. Yu, Finding a maximum clique in an arbitrary graph, SIAM Journal on Computing, vol.14, pp.1054-1068, 1986.

N. Bansal, A. Blum, and S. Chawla, Correlation clustering, Proceedings of the 43rd annual IEEE symposium of foundations of computer science, pp.238-250, 2002.

F. Barahona and A. R. Mahjoub, Facets of the balanced (acyclic) induced subgraph polytope, Mathematical Programming, vol.45, pp.21-33, 1989.

J. J. Barthold, A good submatrix is hard to find, Operations Research Letters, vol.1, pp.190-193, 1982.

M. S. Bazaraa, J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows, 2009.

V. Boginski, S. Butenko, and P. M. Pardalos, Mining market data: A network approach, Computers and Operations Research, vol.33, pp.3171-3184, 2006.

D. Cartwright and F. Harary, Structural balance: A generalization of heiders theory, Psychological Review, vol.63, pp.277-293, 1956.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

B. Dasgupta, G. A. Encisob, E. Sontag, and Y. Zhanga, Algorithmic and complexity results for decompositions of biological networks into monotone subsystems, BioSystems, vol.90, pp.161-178, 2007.

P. Doreian and A. Mrvar, A partitioning approach to structural balance, Social Networks, vol.18, pp.149-168, 1996.

P. Doreian and A. Mrvar, Partitioning signed social networks, Social Networks, vol.31, pp.1-11, 2009.

T. A. Feo, M. G. Resende, . H. St, and . Smith, A greedy randomized adaptive search procedure for maximum independent set, Operations Research, vol.42, pp.860-878, 1994.

P. Festa and M. G. Resende, GRASP: an annotated bibliography, 2002.

R. Figueiredo and Y. Frota, An improved branch-and-cut code for the maximum balanced subgraph of a signed graph, CoRR, 2013.

R. Figueiredo, M. Labbé, and C. C. De-souza, An exact approach to the problem of extracting an embedded network matrix, Computers & Operations Research, vol.38, pp.1483-1492, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01255529

N. Gülpinar, G. Gutin, G. Mitra, and A. Zverovitch, Extracting pure network submatrices in linear programs using signed graphs, Discrete Applied Mathematics, vol.137, pp.359-372, 2004.

G. Gutin, D. Karapetyan, and I. Razgon, Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs, Proceedings of the 4th International Workshop on Parameterized and Exact Computation, pp.222-233, 2009.

F. Harary and J. A. Kabell, A simple algorithm to detect balance in signed graphs, Mathematical Social Sciences, vol.1, pp.131-136, 1980.

F. Harary, M. Lim, and D. C. Wunsch, Signed graphs for portfolio analysis in risk management, IMA Journal of Management Mathematics, vol.13, pp.1-10, 2003.

F. Heider, Attitudes and cognitive organization, Journal of Psychology, vol.21, pp.107-112, 1946.

F. Huffner, N. Betzler, and R. Niedermeier, Separator-based data reduction for signed graph balancing, Journal of Combinatorial Optimization, vol.20, pp.335-360, 2010.

R. Martí, M. G. Resende, and C. C. Ribeiro, Multi-start methods for combinatorial optimization, European Journal of Operational Research, vol.226, pp.1-8, 2013.

T. Inohara, On conditions for a meeting not to reach a deadlock, Applied Mathematics and Computation, vol.90, pp.1-9, 1998.

K. T. Macon, P. J. Mucha, and M. A. Porter, Community structure in the united nations general assembly, Physica A: Statistical Mechanics and its Applications, vol.391, pp.343-361, 2012.

M. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming, vol.5, pp.199-215, 1973.

V. Th and . Paschos, A ?/2-approximation for the maximum independent set problem, Information Processing Letters, vol.44, pp.11-13, 1992.

M. A. Porter, J. Onnela, and P. J. Mucha, Communities in networks, Notices of the AMS, vol.56, pp.1082-1166, 2009.

S. Rebennack, M. Oswald, D. O. Theis, H. Seitz, G. Reinelt et al., A branch and cut solver for the maximum stable set problem, Journal of Combinatorial Optimization, vol.21, pp.434-457, 2011.

F. Rossi and S. Smriglio, A branch-and-cut algorithm for the maximum cardinality stable set problem, Operations Research Letters, vol.28, pp.63-74, 2001.

, FICO Xpress Optimization Suite. Xpress-Optimizer reference manual, 2009.

V. A. Traag and J. Bruggeman, Community detection in networks with positive and negative links, Physical Review E, vol.80, p.36115, 2009.

V. Valls, M. A. Perez, and M. Quintanilla, Pre-processing techniques for resource allocation in the heterogeneous case, European Journal of Operational Research, vol.107, pp.470-491, 1998.

B. Yang, W. K. Cheung, and J. Liu, Community mining from signed social networks, IEEE Transactions on Knowledge and Data Engineering, vol.19, pp.1333-1348, 2007.

T. Zaslavsky, A mathematical bibliography of signed and gain graphs and allied areas, Electronic Journal of Combinatorics DS8, 1998.