A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem

DOI10.1007/s10479-007-0229-6zbMath1145.68043OpenAlexW1992489324MaRDI QIDQ2468764

William H. Hsu, Haipeng Guo

Publication date: 25 January 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0229-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) General topics in the theory of algorithms (68W01)

Related Items

Portfolio approaches for constraint optimization problems ⋮ Predicting pediatric clinic no-shows: a decision analytic framework using elastic net and Bayesian belief network ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges

Uses Software

• PYTHIA
• DIMACS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
• A Bayesian method for the induction of probabilistic networks from data
• Approximating MAPs for belief networks is NP-hard and other theorems
• Probability propagation
• Local search algorithms for SAT: an empirical evaluation
• Measures of Presortedness and Optimal Sorting Algorithms
• Empirical hardness models
• Instance complexity
• Needed: An Empirical Science of Algorithms
• Automated selection of mathematical software
• PYTHIA-II
• An algebra of bayesian belief universes for knowledge‐based systems
• Experimental evaluation of heuristic optimization algorithms: A tutorial