Problème de la bipartition minimale d'un graphe
From MaRDI portal
Publication:3765553
DOI10.1051/ro/1987210403251zbMath0628.90049MaRDI QIDQ3765553
Pierre Hansen, Catherine Roucairol
Publication date: 1987
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104927
Lagrangian relaxation; branch-and-bound; lower bound; maximum flow; minimal cut; arc-weighted graph; minimal bipartitioning
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C20: Quadratic programming
90B10: Deterministic network models in operations research
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
90C09: Boolean programming
Related Items
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem, Lagrangean methods for 0-1 quadratic problems, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint