Comparing Problem Solving Strategies for NP-hard Optimization Problems

DOI10.3233/FI-2013-822zbMath1268.68151OpenAlexW1523311306MaRDI QIDQ5325974

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

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

metaheuristicstestingproblem solvinghuman reasoningNP-hard problemsheuristic 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)

Related Items (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