scientific article; zbMATH DE number 2172799

zbMath1076.68609MaRDI QIDQ4680187

Vladimir Filipović

Publication date: 7 October 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

genetic algorithmsNP-hard problemsSPLPtournament selectiontheoretical estimations

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Computing the metric dimension of graphs by genetic algorithms ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Solving the robust two-stage capacitated facility location problem with uncertain transportation costs ⋮ Genetic algorithms for solving the discrete ordered median problem ⋮ Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ Computing minimal doubly resolving sets of graphs ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ Hybrid metaheuristic method for determining locations for long-term health care facilities

This page was built for publication: