Pages that link to "Item:Q274945"
From MaRDI portal
The following pages link to A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945):
Displaying 7 items.
- A mixed integer linear programming formulation of the maximum betweenness problem (Q976481) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Solving the maximally balanced connected partition problem in graphs by using genetic algorithm (Q2844500) (← links)
- A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (Q5279220) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
