, United Nations General Assembly Session 55 Resolution 56. The role of diamonds in fuelling conflict: breaking the link between the illicit transaction of rough diamonds and armed conflict as a contribution to prevention and settlement of conflicts A/RES/55/56

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. Campêlo, V. A. Campos, and R. C. Correa, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, vol.156, pp.1097-1111, 2008.

M. Campelo, R. C. Correa, and Y. Frota, Cliques, holes and the vertex coloring polytope, Information Processing Letters, vol.89, pp.1097-1111, 2004.

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

D. Cartwright and F. Harary, A note on a matrix criterion for unique colorability of a signed graph, Psychometrik, vol.32, pp.291-296, 1967.

D. Catanzaro, A. Godi, and M. Labbé, A class representative model for pure parsimony haplotyping, INFORMS Journal on Computing, vol.22, pp.195-209, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01255538

M. Charikara, V. Guruswamib, and A. Wirtha, Clustering with qualitative information, Journal of Computer and System Sciences, vol.71, pp.360-383, 2005.

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.

J. A. Davis, Clustering and structural balance in graphs, Human Relations, vol.20, pp.181-187, 1967.

E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, Correlation clustering in general weighted graphs, Theoretical Computer Science, vol.361, pp.172-187, 2006.
DOI : 10.1016/j.tcs.2006.05.008
URL : https://doi.org/10.1016/j.tcs.2006.05.008

P. Doreian and A. Mrvar, A partitioning approach to structural balance, Social Networks, vol.18, pp.149-168, 1996.
DOI : 10.1016/0378-8733(95)00259-6

P. Doreian and A. Mrvar, Partitioning signed social networks, Social Networks, vol.31, pp.1-11, 2009.
DOI : 10.1016/j.socnet.2008.08.001

L. Drummond, R. Figueiredo, Y. Frota, and M. Levorato, Efficient solution of the correlation clustering problem: an application to structural balance, Proceedings of OTM 2013 Workshops, vol.8186, pp.674-683, 2013.
DOI : 10.1007/978-3-642-41033-8_85

P. Esmailian, S. E. Abtahi, and M. Jalili, Mesoscopic analysis of online social networks: The role of negative ties, Phys. Rev. E, vol.90, p.42817, 2014.

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

R. Figueiredo and Y. Frota, The maximum balanced subgraph of a signed graph: applications and solution approaches, European Journal of Operational Research, vol.236, issue.2, pp.473-487, 2014.

R. Figueiredo, Y. Frota, and M. Labbé, Solution of the maximum kbalanced subgraph problem, Learning and Intelligent Optimization, pp.266-271, 2013.
DOI : 10.1007/978-3-642-44973-4_28
URL : https://hal.archives-ouvertes.fr/hal-01255521

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

R. Figueiredo and G. Moura, Mixed integer programming formulations for clustering problems related to structural balance, Social Networks, vol.35, pp.639-651, 2013.
DOI : 10.1016/j.socnet.2013.09.002

Y. Frota, N. Maculan, T. F. Noronha, and C. C. Ribeiro, A branch-and-cut algorithm for partition coloring, Networks, vol.55, pp.194-204, 2010.
DOI : 10.1002/net.20365
URL : http://www2.ic.uff.br/~celso/artigos/bcpcp2.pdf

M. R. Garey and D. S. Johnson, Computers and intractability, 2003.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, vol.99, pp.7821-782, 2002.
DOI : 10.1073/pnas.122653799
URL : http://www.pnas.org/content/99/12/7821.full.pdf

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.

F. Harary and J. A. , A simple algorithm to detect balance in signed graphs, Mathematical Social Sciences, vol.1, pp.131-136, 1980.
DOI : 10.1016/0165-4896(80)90010-4

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.
DOI : 10.1093/imaman/13.3.201

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

M. Padberg and K. L. Hoffman, Solving airline crew scheduling problems. Management Sciense, vol.39, pp.657-682, 1993.

N. Howard, n-person soft games, Journal of the Operational Research Society, vol.49, pp.144-150, 1998.

T. Inohara, A formal theory on decision making with interperception, 1997.

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

T. Inohara, Characterization of clusterability of signed graph in terms of newcomb's balance of sentiments, Applied Mathematics and Computation, vol.133, pp.93-104, 2002.

T. Inohara, Clusterability of groups and information exchange in group decision making with approval voting system, Applied Mathematics and Computation, vol.136, pp.1-15, 2003.

M. Levorato, R. Figueiredo, Y. Frota, and L. Drummond, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, EURO Journal on Computational Optimization, vol.5, pp.467-498, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02178542

H. R. Lourenço, O. C. Martin, and T. Stutzle, Handbook of Metaheuristics, chapter Iterated Local Search, pp.1355-1377, 2003.

I. Mendonça, R. Figueiredo, V. Labatut, and P. Michelon, Relevance of negative links in graph partitioning: A case study using votes from the european parliament, 2015 Second European Network Intelligence Conference, ENIC 2015, pp.122-129, 2015.

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.

G. L. Nemhauser and A. L. Wolsey, Integer and Combinatorial Optimization, 1988.

M. G. Resende and C. C. Ribeiro, Search Methodologies, 2011.

, Resolutions and Decisions from the 55 th Session, 2016.

, The Notable General Assembly Resolutions, 2016.

, Kimberley Process Certification Scheme, 2016.

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.