Extraction et partitionnement pour la recherche de régularités : Applicationà l'analyse de dialogues, 2014. ,
An extended edge-representative formulation for the k-partitioning problem, Electron. Notes Discr. Math, vol.52, pp.333-342, 2016. ,
On the polyhedron of the k-partitioning problem with representative variables, 2014. ,
Polyhedral combinatorics of the kpartitioning problem with representative variables, Discr. Appl. Math, vol.211, pp.1-14, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01759687
Extraction de motifs dialogiques bidimensionnels, vol.29, pp.655-684, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00989237
Extraction and clustering of twodimensional dialogue patterns, Int. J. Artificial Intelligence Tools, vol.27, p.1850001, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01944000
On the cut polytope, Math. Program, vol.36, pp.157-173, 1986. ,
A survey of clustering data mining techniques, Springer, Pavel Berkhin, Accrue Software, 1045 Forest Knoll Dr, pp.25-71, 2006. ,
On the solution of a graph partitioning problem under capacity constraints, Lecture Notes in Computer Science, vol.7422, pp.285-296, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01272895
Compact mathematical formulation for graph partitioning, Optim. Eng, vol.5, pp.315-333, 2004. ,
On the asymmetric representatives formulation for the vertex coloring problem, Discr. Appl. Math, vol.156, pp.1097-1111, 2008. ,
The partition problem, Math. Program, vol.59, pp.87-115, 1993. ,
Facets of the k-partition polytope, Discr. Appl. Math, vol.61, pp.27-48, 1995. ,
An Integer Programming Approach to Image Segmentation and Reconstruction Problems pp, pp.475-496, 2007. ,
Clique-web facets for multicut polytopes, Math. Oper. Res, vol.17, pp.981-1000, 1992. ,
Linear and quadratic programming approaches for the general graph partitioning problem, J. Global Optim, vol.48, pp.57-71, 2010. ,
Robust optimization of graph partitioning involving interval uncertainty, Theor. Comput. Sci, vol.447, pp.53-61, 2012. ,
Formulations and valid inequalities for the node capacitated graph partitioning problem, Math. Program, vol.74, pp.247-266, 1996. ,
The node capacitated graph partitioning problem: A computational study, Math. Program, vol.81, pp.229-256, 1998. ,
Some simplified NP-complete graph problems, Theor. Comput. Sci, vol.1, pp.237-267, 1976. ,
A polynomial algorithm for the k-cut problem for fixed k, Math. Oper. Res, vol.19, pp.24-37, 1994. ,
A cutting plane algorithm for a clustering problem, Math. Program, vol.45, pp.59-96, 1989. ,
Facets of the clique partitioning polytope, Math. Program, vol.47, pp.367-387, 1990. ,
Cluster analysis and mathematical programming, Math. Program, vol.79, pp.191-215, 1997. ,
An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput, vol.16, pp.452-469, 1995. ,
Data clustering: 50 years beyond k-means, Pattern Recognition Lett, vol.31, pp.651-666, 2010. ,
Min-cut clustering, Math. Program, vol.62, pp.133-151, 1993. ,
, Orbitopal fixing, Discr. Optim, vol.8, pp.595-610, 2011.
An efficient heuristic procedure for partitioning graphs, Bell System Tech, J, vol.49, pp.291-307, 1970. ,
On finding dense subgraphs, Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, pp.597-608, 2009. ,
Size-constrained graph partitioning polytopes, Discr. Math, vol.310, pp.3473-3493, 2010. ,
Interactive color image segmentation with linear programming, Machine Vision Appl, vol.21, pp.403-412, 2010. ,
Contributions to determining exact ground-states of Ising spin-glasses and to their physics, 2004. ,
Computing exact ground states of hard Ising spin glass problems by branch-and-cut, New Optimization Algorithms in Physics, pp.47-69, 2004. ,
Graph partitioning using linear and semidefinite programming, Math. Program, vol.95, pp.91-101, 2003. ,
Branch-and-cut for the k-way equipartition problem, Mathematical Sciences, 2001. ,
The clique partitioning problem: Facets and patching facets, Networks, vol.38, pp.209-226, 2001. ,
TSPLIB -A traveling salesman problem library, pp.376-384, 1991. ,
b-tree facets for the simple graph partitioning polytope, J. Combinatorial Optim, vol.8, pp.151-170, 2004. ,
Facet-defining inequalities for the simple graph partitioning polytope, Discr. Optim, vol.4, pp.221-231, 2007. ,
Parallel dynamic graph partitioning for adaptive unstructured meshes, J. Parallel Distrib. Comput, vol.47, pp.102-108, 1997. ,