In this paper, an integer linear programming (ILP) model is newly introduced for the problem. Two meta-heuristics are then derived from the ILP relaxation.

Pole Przemyslaw "Psyho" Debiak won the prestigious AWTF Heuristic programming tournament. He beat not only the human participants, but also AI. He is the only human to have succeeded.

We show that the tightness of the linear programming relaxation of these formulations is directly related to the performance of a class of heuristics called parameter list scheduling heuristics.

The AtCoder World Tour Finals (AWTF) is the final stage of heuristic programming competitions that focus on solving complex problems rather than trivial tasks. This year’s challenge was to build a ...