Explore algorithm adoption, the latest submissions, and active tracks across TIG's challenges.
Solve random 3-SAT instances near the classical phase transition, where clause density makes satisfiability hardest to determine.
Optimize fleet routes across large delivery networks while minimizing traversal cost and satisfying operational constraints.
Select high-value item combinations under a fixed budget while accounting for pairwise interactions between every choice.
Retrieve nearest neighbors across high-dimensional datasets with low latency and consistently strong recall.
Partition connected nodes evenly while minimizing cut hyperedges for efficient parallel and distributed computation.
Optimize neural-network configurations across hidden-layer budgets to improve model quality under bounded compute.
Schedule dependent operations across constrained machines to reduce makespan across multiple shop configurations.
Schedule energy storage across changing price and congestion scenarios to maximize return while respecting system constraints.