Pages that link to "Item:Q3807012"
From MaRDI portal
The following pages link to Lower bounds to the graph partitioning problem through generalized linear programming and network flows (Q3807012):
Displaying 8 items.
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Image space approach to penalty methods (Q1117841) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- Topological graph clustering with thin position (Q2248883) (← links)
- Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem (Q4950824) (← links)