Branch-and-bound and quadratic programming for graph bipartitioning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Branch-and-bound and quadratic programming for graph bipartitioning

Serigne Gueye
Philippe Michelon
Fichier non déposé

Dates et versions

hal-02468004 , version 1 (05-02-2020)

Identifiants

  • HAL Id : hal-02468004 , version 1

Citer

Serigne Gueye, Philippe Michelon. Branch-and-bound and quadratic programming for graph bipartitioning. International Symposium on Mathematical Programming (ISMP'2000), 2000, Atlanta, United States. ⟨hal-02468004⟩

Collections

UNIV-AVIGNON LIA
13 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More