Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...