"Computational study of a branching algorithm for the maximum k-cut problem."

Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel (2022)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2021.100656

access: closed

type: Journal Article

metadata version: 2022-06-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/SousaAD22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/SousaAD22
Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Computational study of a branching algorithm for the maximum k-cut problem. Discret. Optim. 44(Part): 100656 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.