vix.ing · top · new · best · stats

Formulations and valid inequalities for the node capacitated graph partitioning problem

1996/09/01 by Carlos Eduardo Ferreira, C. E. Ferreira, Alexander Martín +7 · 90 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Convex hull #Graph #Graph partition #Integer programming #Interconnection Networks and Systems #Mathematical optimization #Mathematics #Partition (number theory) #Regular polygon #Robustness (evolution) #VLSI and FPGA Design Techniques

paper · open access · doi:10.1007/bf02592198

published in Mathematical Programming 74(3), 247-266 (Springer Science+Business Media)

openalex publication_date 1996/09/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/29

Cited by