Pages that link to "Item:Q1904713"
From MaRDI portal
The following pages link to On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713):
Displaying 3 items.
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
- Lower bounds to the graph partitioning problem through generalized linear programming and network flows (Q3807012) (← links)
- Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem (Q4950824) (← links)