Traub and Vygen Win 2026 Frederick W. Lanchester Prize

The authors are honored for their 2024 book on algorithms for solving complex traveling salesperson problems.

Updated on Oct. 28, 2026 in Mathematics

Isometric editorial illustration featuring a complex metallic network lattice, representing the algorithmic challenge of routing efficiency.
Mathematicians Vera Traub and Jens Vygen were awarded the 2026 Frederick W. Lanchester Prize for their academic text on traveling salesperson algorithms. AI Illustration. Upload story photo >

Vera Traub and Jens Vygen have been awarded the 2026 Frederick W. Lanchester Prize for their book, 'Approximation Algorithms for Traveling Salesman Problems.' Published in 2024 by Cambridge University Press, the text synthesizes major advancements across the various configurations of the classic optimization challenge.

Why it matters

The award recognizes significant contributions to the field of operations research, specifically highlighting the consolidation of algorithmic techniques used to solve complex routing problems. This work provides a definitive modern framework for mathematicians and computer scientists tackling the traveling salesperson problem.

The 2024 text provides a comprehensive synthesis of original contributions to the traveling salesperson problem, an optimization challenge where the goal is to find the shortest possible route through a set of locations. It documents both existing methodologies and strengthened algorithmic results compared to the prior state of the literature.

The players

Vera Traub

An associate professor in the Department of Computer Science at ETH Zurich focused on algorithm research.

Jens Vygen

A professor of discrete mathematics at the University of Bonn specializing in operations research.

INFORMS

The Institute for Operations Research and the Management Sciences which awards the annual Lanchester Prize.

The details

The authors explain the optimization of the traveling salesperson problem by consolidating diverse variants into a singular academic resource. An approximation algorithm—a procedure designed to find near-optimal solutions to computationally hard problems—is detailed throughout the text. These methods refine how researchers approach routing efficiency in complex networks.

Timeline

  1. 1954: The Frederick W. Lanchester Prize is established.

  2. 2024: Cambridge University Press publishes the prize-winning book.

  3. 2026: Vera Traub and Jens Vygen receive the award.

The Tech Race

This award places the authors among a long line of researchers honored by the Frederick W. Lanchester Prize, which has tracked excellence in operations research since 1954. Their work serves as a new benchmark for how optimization research is codified for academic and industry application.

Researchers and software engineers can access the consolidated findings in the published volume from Cambridge University Press. The work serves as a primary reference for those building routing software or solving logistical optimization problems in industry.

The takeaway

The 2026 prize reaffirms the significance of rigorous approximation techniques in modern computational routing. Readers should look for the presentation of the award at the upcoming 2026 INFORMS Annual Meeting in San Francisco.

Further reading

Explore deeper developments in Mathematics to understand how optimization algorithms are evolving.

Source note: This article includes information reported by ETH Zurich.