Pages that link to "Item:Q1959249"

The following pages link to Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249):

Displaying 18 items.

• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• Using hierarchical clustering and dendrograms to quantify the clustering of membrane proteins (Q417340) (← links)
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
• Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
• Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
• Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
• Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
• SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
• Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
• Employee workload balancing by graph partitioning (Q2448894) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
• Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
• Graph Clustering Via Intra-Cluster Density Maximization (Q3294900) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• Graph clustering with Boltzmann machines (Q6140246) (← links)
• Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm (Q6173938) (← links)