The ring loading problem
What is the ring loading constant β of Schrijver, Seymour and Winkler: the smallest α such that for any nonnegative u_i, v_i with u_i + v_i ≤ 1 one can choose each z_i as v_i or −u_i with |(z_1 + … + z_k) − (z_{k+1} + … + z_m)| ≤ α for every k?
Summary
Problem 61 of the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao and Wagner, 2025). Schrijver, Seymour and Winkler proved 101/100 ≤ β ≤ 3/2; Skutella narrowed this to 11/10 ≤ β ≤ 19/14, and Däubel proved β ≤ 13/10. The source asks for upper and lower bounds on β that are as strong as possible.
Source
Open, as listed by AlphaEvolve repository of problems, problem 61 · AlphaEvolve repository of problems. Checked 20 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.