A branch-and-bound algorithm for the graph partitioning problem - Archive ouverte HAL
Communication Dans Un Congrès Année : 2003

A branch-and-bound algorithm for the graph partitioning problem

Serigne Gueye
Philippe Michelon
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-02467637 , version 1

Citer

Serigne Gueye, Philippe Michelon. A branch-and-bound algorithm for the graph partitioning problem. International Symposium on Mathematical Programming (ISMP'2003), 2003, Copenhague, Denmark. ⟨hal-02467637⟩

Collections

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

Partager

More