Comparing problem solving strategies for NP-hard optimization problems

DOI10.3233/FI-2013-822MaRDI QIDQ5325974zbMATH OpenOpenAlexFDO

Authors Mercedes Hidalgo-Herrero, Pablo Rabanal, Ismael Rodríguez, Fernando Rubio

Publication date 31 July 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2013-822

zbMATH Keywords

metaheuristicstestingNP-hard problemsproblem solvinghuman reasoningheuristic methodslearning strategieshuman-computer comparison

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 67483
• scientific article; zbMATH DE number 1953201
• scientific article; zbMATH DE number 809154
• Neural networks for NP-complete problems
• The complexity of optimization problems

Cited in

(3)

• Practices in timetabling in higher education institutions: a systematic review
• Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems
• A new model for curriculum-based university course timetabling

This page was built for publication: Comparing problem solving strategies for NP-hard optimization problems

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