All challenges

Choose machine orders for a job-shop instance to minimize makespan.

Hire optional residents as shuttle routes to reduce weighted travel demand over islands.

Construct a compact weighted DAG whose paths represent exactly one integer interval.

Select an independent set under the original complement-style Frontier-CS scoring formula.

Find a long no-repeat path in a directed graph and score by path-length thresholds.

Assign three colors to minimize conflicting graph edges.

Color a graph with as few colors as possible.

Sort a permutation while compensating for planned swaps at low energy cost.

Produce an edit transcript that captures a long common subsequence alignment.

Pick one landing point per city and order a closed drone delivery route.

Print an 8 by 14 digit grid that can read a long prefix of positive integers by adjacent walks.

Permute names to reduce substring complaint costs over adjacent pairs.