scientific article; zbMATH DE number 2172799

MaRDI QIDQ4680187zbMATH OpenFDO

Authors V. Filipovic

Publication date 7 October 2005

zbMATH Keywords

genetic algorithmsNP-hard problemsSPLPtheoretical estimationstournament selection

Mathematics Subject Classification ID

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

Recommendations

• Experimental results in applying of fine grained tournament selection
• Mixed size tournament selection
• Finite population effects for ranking and tournament selection
• scientific article; zbMATH DE number 1617341
• Planned tournament selection

Cited in

(13)

• Computing minimal doubly resolving sets of graphs
• Mixed size tournament selection
• Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
• Hybrid metaheuristic method for determining locations for long-term health care facilities
• scientific article; zbMATH DE number 2013536 (Why is no real title available?)
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Experimental results in applying of fine grained tournament selection
• An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
• Computing the metric dimension of graphs by genetic algorithms
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• Genetic algorithms for solving the discrete ordered median problem
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680187)