The following pages link to (Q4680187):
Displaying 9 items.
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Genetic algorithms for solving the discrete ordered median problem (Q884020) (← 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)
- Solving the robust two-stage capacitated facility location problem with uncertain transportation costs (Q1677305) (← links)
- Hybrid metaheuristic method for determining locations for long-term health care facilities (Q2347594) (← links)
- An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784) (← links)
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations (Q6160435) (← links)
