• East Asian mathematical journal
• /
• 제15권1호
• /
• pp.147-151
• /
• 1999

• Management Science and Financial Engineering
• /
• 제15권2호
• /
• pp.119-123
• /
• 2009

The minimum multicut problem on a cycle is to find a multicut on an undirected cycle such that the sum of weights is minimized, which is known to be polynomially solvable. This paper shows that there exists a compact polyhedral description of the set of feasible solutions to the problem whose number of variables and constraints is O($\upsilon\kappa$).