We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in the search space. We show why ordinal correlation is relevant to heuristic se...
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
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...