Lower bounds to the graph partitioning problem through generalized linear programming and network flows (Q3807012): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2468889070 / rank | |||
Normal rank | |||
Latest revision as of 22:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds to the graph partitioning problem through generalized linear programming and network flows |
scientific article |
Statements
Lower bounds to the graph partitioning problem through generalized linear programming and network flows (English)
0 references
1987
0 references
exact solution
0 references
graph partitioning
0 references
branch-and-bound
0 references
sharp bounds
0 references
large-scale set partitioning
0 references
large-scale Boolean linear programming
0 references
continuous relaxation
0 references
column generation subproblem
0 references
quadratic pseudo- Boolean minimization
0 references
max-flow
0 references
polynomial solvability
0 references
