scientific article; zbMATH DE number 1737515

MaRDI QIDQ4529634zbMATH OpenFDO

Authors Jozef Kratica

Publication date 5 May 2002

zbMATH Keywords

genetic algorithmscachingsimple plant location problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1962012
• scientific article; zbMATH DE number 1869826
• Solving the simple plant location problem by genetic algorithm
• scientific article; zbMATH DE number 2007892
• scientific article; zbMATH DE number 1874333

Cited in

(9)

• Registrar: a complete-memory operator to enhance performance of genetic algorithms
• A simple tabu search for warehouse location
• Computing the metric dimension of graphs by genetic algorithms
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• The trap of Sisyphean work in differential evolution and how to avoid it
• Parallel Processing and Applied Mathematics
• Solving the simple plant location problem by genetic algorithm
• Genetic algorithms for solving the discrete ordered median 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 Q4529634)