Formulations and Valid Inequalities for the Node Capacitated Graph Partitioning Problem
Year of publication: |
1994-08-01
|
---|---|
Authors: | FERREIRA, Carlos E. ; MARTIN, Alexander ; SOUZA, Cid C. de ; WEISMANTEL, Robert |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | clustering | graph partitioning | equipartition | knapsack | integer programming | ear decomposition |
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
An Optimization Based Heuristic for Political Districting
Mehrotra, Anuj, (1998)
-
Interactions-based risk clustering methodologies and algorithms for complex project management
Marle, Franck, (2013)
- More ...
-
The node capacitated graph partitioning problem: A computational study
FERREIRA, Carlos E.,
-
The node capacitated graph partitioning problem: A computational study
FERREIRA, Carlos E.,
-
The Node Capacitated Graph Partitioning Problem : A Computational Study
FERREIRA, Carlos E., (1994)
- More ...