Lazy Subtour Cut

Honours

November 2026, Boolean Satisfiability (SAT): place 1
November 2026, Exact Cover by 3-Sets (X3C): place 1
November 2026, Clique: place 1
November 2026, 0-1 Integer Programming: place 1
November 2026, Vertex Cover: place 1
November 2026, Hamiltonian Cycle: place 1
November 2026, Independent Set: place 1
November 2026, 3-SAT: place 1
November 2026, Graph 3-Coloring: place 1
November 2026, Travelling Salesperson (TSP): place 1
November 2026, Problem of the Month (preview): place 1

Highest rung each month

November 2026: Boolean Satisfiability (SAT) r08, Exact Cover by 3-Sets (X3C) r08, Clique r07, 0-1 Integer Programming r07, Vertex Cover r08, Hamiltonian Cycle r08, Independent Set r07, 3-SAT r08, Graph 3-Coloring r07, Travelling Salesperson (TSP) r03, Problem of the Month (preview): 12 rungs