Pages that link to "Item:Q2844500"
From MaRDI portal
The following pages link to Solving the maximally balanced connected partition problem in graphs by using genetic algorithm (Q2844500):
Displaying 6 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Genetic local search for the graph partitioning problem under cardinality constraints (Q2901171) (← links)
- (Q3400313) (← links)
- (Q3416563) (← links)