Polyhedral combinatorics of the k-partitioning problem with representative variables, Discrete Applied Mathematics, vol.211, pp.1-14, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01759687
On the cut polytope, Mathematical Programming, vol.36, pp.157-173, 1986. ,
An approximation algorithm for the maximum cut problem and its experimental analysis, Discrete Applied Mathematics, vol.110, pp.3-12, 2001. ,
Branch-and-cut algorithm for the connected-cut problem, ROADEF -15ème congrès annuel de la Société française de recherche opérationnelle et d'aideà la décision, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00946285
Vertex and tree arboricities of graphs, Journal of Combinatorial Optimization, vol.8, pp.295-306, 2004. ,
Computational symposium: Graph coloring and its generalizations, 2002. ,
On the complexity of graph tree partition problems, Discrete Applied Mathematics, vol.134, pp.51-65, 2004. ,
An exact algorithm for max-cut in sparse graphs, Operations Research Letters, vol.35, pp.403-408, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00116633
Randomized heuristics for the max-cut problem, Optimization Methods and Software, vol.17, pp.1033-1058, 2002. ,
Improved approximation algorithms for max k-cut and max bisection, Integer Programming and Combinatorial Optimization. IPCO 1995, vol.920, pp.1-13, 1995. ,
Improved approximation algorithms for maximum cut and satisfiability problems using semidefine programming, Journal of the Association for Computing Machinery, vol.42, pp.1115-1145, 1995. ,
Polynomial algorithm for the k-cut problem, 29th Ann. Symp. Foundation of Computer Science, pp.444-451, 1988. ,
Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput, vol.4, pp.221-225, 1975. ,
Approximation and intractability results for the maximum cut problem and its variants, IEEE Transactions on Computers, vol.40, pp.110-113, 1991. ,
Mixed-integer programming techniques for the connected max-k-cut problem. Unpublished, 2018. ,
On greedy construction heuristics for the max-cut problem, Int. J. of Computational Science and Engineering, vol.3, pp.211-218, 2007. ,
Reducibility among combinatorial problems, Complexity of Computer Computations. The IBM Research Symposia Series, pp.85-103, 1972. ,
Solving large scale max cut problems via tabu search, J Heuristics, vol.19, pp.565-571, 2013. ,
An effective heuristic algorithm for the traveling-salesman problem, Operations Research, vol.21, pp.498-516, 1973. ,
A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems, European Journal of Operational Research, vol.197, pp.519-531, 2009. ,
Finding the maximum cut in a graph, Engineering Cybernetics, vol.10, pp.502-506, 1972. ,
Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming, vol.121, pp.307-335, 2008. ,
P-complete approximation problems, Journal of the ACM, vol.23, pp.555-565, 1976. ,
A local search approximation algorithm for max-k-cut of graph and hypergraph, 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming, pp.236-240, 2011. ,