The node capacitated graph partitioning problem: A computational study

Carlos E. Ferreira, Alexander Martin, Cid C. de SOUZA and Robert Weismantel

No 1335, LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Date: 1998-01-01
Note: In : Mathematical programming, 81 (2), 229-256, 1998
References: Add references at CitEc
Citations: View citations in EconPapers (11)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvrp:1335

Access Statistics for this paper

More papers in LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().