Traub and Vygen Win 2026 Lanchester Prize
The mathematicians were honored by INFORMS for their comprehensive work on the traveling salesperson problem.
Updated on Oct. 28, 2026 in Mathematics
Vera Traub and Jens Vygen received the 2026 Frederick W. Lanchester Prize for their recent book on approximation algorithms. The award recognizes their significant contributions to the fields of operations research and management sciences.
Why it matters
The prize honors outstanding published research in operations research and the management sciences, highlighting critical advancements in complex problem-solving. This work provides new theoretical foundations for addressing the classic traveling salesperson problem.
The award recognizes the 2024 publication 'Approximation Algorithms for Traveling Salesman Problems' published by Cambridge University Press. This work consolidates advances across various mathematical variants of the traveling salesperson problem.
The players
Vera Traub
She is an associate professor in the Department of Computer Science at ETH Zurich.
Jens Vygen
He is a professor of discrete mathematics at the University of Bonn.
INFORMS
This is the professional organization that awards the Frederick W. Lanchester Prize to honor research in operations research.
The details
Traub and Vygen were selected for their original contributions and for strengthening previous results in their book. Their research synthesizes complex advances in algorithms, providing a unified framework for solving one of mathematics most famous optimization challenges.
Timeline
The Frederick W. Lanchester Prize was first established in 1954.
The authors published their book through Cambridge University Press in 2024.
Vera Traub and Jens Vygen were named recipients of the prize in 2026.
The Big Picture
This award follows a pattern set by the Frederick W. Lanchester Prize, which has recognized excellence in operations research for over 70 years. The recognition validates the theoretical progress made in reconciling disparate algorithmic approaches to optimization problems.
This research provides more efficient algorithmic foundations that can be applied to logistics, scheduling, and infrastructure management systems. The work helps practitioners solve complex routing tasks with greater precision than previously possible.
The takeaway
The recognition of this book highlights the ongoing progress in solving one of the most enduring challenges in computer science. Researchers and students can look to this text as a definitive consolidation of modern algorithmic strategies for complex network problems.
What happens next
The Frederick W. Lanchester Prize will be formally presented to the recipients at the 2026 INFORMS Annual Meeting held in San Francisco.
Further reading
For more on the current state of advanced research, visit the Mathematics section.
Source note: This article includes information reported by ETH Zurich.
