The node capacitated graph partitioning problem: a computational study

Ferreira, Carlos;Martin, Alexander;De Souza, Cid;Weismantel, Robert;Wolsey, Laurence
(1998) Mathematical Programming — Vol. 81, n° 2, p. 229-256 (1998)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 1.87 MB
Request a copy

Details

Authors
  • Ferreira, Carlos
    Author
  • Martin, Alexander
    Author
  • De Souza, CidUCLouvain
    Author
  • Weismantel, RobertUCLouvain
    Author
  • Wolsey, LaurenceUCLouvain
    Author
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Ferreira, C., Martin, A., De Souza, C., Weismantel, R., & Wolsey, L. (1998). The node capacitated graph partitioning problem: a computational study. Mathematical Programming, 81(2), 229-256. https://doi.org/10.1007/BF01581107 (Original work published 1998)