Pages that link to "Item:Q335322"

The following pages link to Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322):

Displaying 11 items.

• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• The sport teams grouping problem (Q1730756) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
• Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
• A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)