# What is the difference between min- cut formulation and (bi) partitioning formulation?

Operations Research Asked by fathese on January 8, 2021

I have a min-cut formulation and a bi-partitioning problem.
The two problems focus on finding the minimal cut value separating the two partitions?
So what are really the differences between the problems? what are mainly the considered objectives and constraints?

Roughly speaking, in minimum cut problems, the goal is generally to find a minimum cut (possibly weighted) between two fixed sets of vertices, called the sources and the sinks. Given one source and one sink in input, the problem can be solved in polynomial time, a famous theorem in combinatorial optimization.

On the other hand, in graph partitioning problems, the goal is generally to find a partition of the vertices into subsets with a maximum size while minimizing the cut (possibly weighted) between these subsets. For example, the bisection problem consists of finding a partition of the vertices into two subsets of equal size, while the minimum cut between the two subsets is minimum. This problem is known to be NP-hard.

But in the end, this is a matter of precise definition of the problem to be solved. Some cut problems are polynomial; some others are NP-hard (for example, the so-called maximum cut problem). The same holds for graph partitioning problems.

Answered by LocalSolver on January 8, 2021

## Related Questions

### How to optimize a utility function that contains step function?

1  Asked on January 5, 2022

### How to display the range of coefficients in docplex log?

1  Asked on January 1, 2022 by ehsank

### Scenario based approach to value-at-risk optimization using mixed-integer programming

1  Asked on January 1, 2022

### Multiple Knapsacks with splitting

1  Asked on December 20, 2021 by cesar-canassa

### How to balance the workload of teachers in OR-Tools (maximization of the minimum)

1  Asked on December 18, 2021 by neverletgo

### How to linearize a quadratic constraint to add it then via a callback function

2  Asked on December 9, 2021 by farouk-hammami

### Decision variable transformation in Gurobi

2  Asked on December 5, 2021

### Possibility of indexing decision variables with 2 indices using a set of tuples in Pyomo

3  Asked on November 24, 2021

### View of Constraints and Decision Variables in Pyomo

1  Asked on November 17, 2021

### CPLEX Python API Manual with References

1  Asked on November 4, 2021

### Are Python and Julia used for optimization in industry?

15  Asked on August 19, 2021

### How to improve the quality of code in OR?

3  Asked on August 19, 2021

### How would you characterize “optimization data?”

4  Asked on August 19, 2021 by marco-lbbecke

### Local optimum of dual of non-linear program

2  Asked on August 19, 2021

### Combinatorial Optimization using AMPL

2  Asked on August 19, 2021 by user3831

### Parallel nonlinear solvers

3  Asked on August 19, 2021 by josh-allen

### Tips on How to Review Operations Research Literature Effectively?

2  Asked on August 19, 2021 by ehsan

### Polynomially solvable cases of zero-one programming

1  Asked on August 19, 2021

### Error evalution for linear fits

1  Asked on August 19, 2021 by jane