Pages that link to "Item:Q274945"

The following pages link to A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945):

Displaying 3 items.

• Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)