Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Problème de la bipartition minimale d'un graphe

Catherine Roucairol, Pierre Hansen

RAIRO-Oper. Res., 21 4 (1987) 325-348

Published online: 2017-02-06

DOI: https://doi.org/10.1051/ro/1987210403251

This article has been cited by the following article(s):

Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée

Philippe Michelon, Stéphanie Ripeau and Nelson Maculan
RAIRO - Operations Research 35 (4) 401 (2001)
https://doi.org/10.1051/ro:2001122

On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint

P. Ciarlet and F. Lamour
Numerical Algorithms 12 (1) 193 (1996)
https://doi.org/10.1007/BF02141748

Lagrangean methods for 0–1 quadratic problems

Philippe Michelon and Nelson Maculan
Discrete Applied Mathematics 42 (2-3) 257 (1993)
https://doi.org/10.1016/0166-218X(93)90049-T

Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem

Jens Clausen and Jesper Larsson Träff
Annals of Operations Research 33 (5) 329 (1991)
https://doi.org/10.1007/BF02073939