Pages that link to "Item:Q959488"
From MaRDI portal
The following pages link to Compact mathematical formulation for graph partitioning (Q959488):
Displaying 13 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Automatic Generation of Symmetry-Breaking Constraints (Q5505671) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
