"A branch-and-cut algorithm for the connected max-k-cut problem."

Patrick Healy et al. (2024)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2023.06.015

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/HealyJLMMR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/HealyJLMMR24
Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312(1): 117-124 (2024)

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.