Pages that link to "Item:Q2668747"
From MaRDI portal
The following pages link to Metaheuristics for the minimum gap graph partitioning problem (Q2668747):
Displaying 3 items.
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm (Q6173938) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)