Combinatorial problems abound in domains such as scheduling, routing, resource allocation and logical inference. Owing to their typically NP-hard nature, no single algorithm uniformly outperforms all ...