Pages that link to "Item:Q4584872"
From MaRDI portal
The following pages link to Integer programming models for detecting graph bipartitions with structural requirements (Q4584872):
Displaying 5 items.
- Integer Programming of Biclustering Based on Graph Models (Q3059306) (← links)
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)