A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base

DOI10.1007/978-3-642-20009-0_32zbMath1421.90174OpenAlexW187407940MaRDI QIDQ5232817

No author found.

Publication date: 13 September 2019

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_32

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Pellet
• Jena
• swrl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The quadratic knapsack problem -- a survey
• A genetic algorithm for the multidimensional knapsack problem
• Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems

This page was built for publication: A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base