학술논문

A branch-and-cut algorithm for the connected max-k-cut problem
Document Type
Article
Source
In: European Journal of Operational Research. (European Journal of Operational Research, 1 January 2024, 312(1):117-124)
Subject
Language
English
ISSN
03772217