INFORMS Honors Traub and Vygen for Traveling Salesman Book

The Institute for Operations Research and the Management Sciences (INFORMS) has awarded the 2026 Frederick W. Lanchester Prize to Vera Traub and Jens Vygen for their book, “Approximation Algorithms for Traveling Salesman Problems,” published by Cambridge University Press. First awarded in 1954, the Lanchester Prize recognizes outstanding published contributions to operations research and the management sciences. The award includes a commemorative medallion and a $5,000 cash prize, which INFORMS said would be presented at the organization’s 2026 Annual Meeting in San Francisco.

The book examines the Traveling Salesman Problem, a mathematical challenge that asks how to identify the shortest route visiting a set of locations and returning to the starting point. The question may appear simple, but the difficulty of finding optimal solutions increases substantially as the number of locations grows. The problem has important connections to transportation, logistics, manufacturing and other applications requiring efficient routing and resource allocation. Traub and Vygen address multiple variations of the problem rather than presenting the Traveling Salesman Problem as a single scenario, bringing together advances in approximation algorithms for these related formulations.

INFORMS said the book does more than provide a comprehensive review of existing research. It introduces original contributions, strengthens previous results and presents sophisticated mathematical techniques with exceptional clarity. By unifying advances across multiple variations of the Traveling Salesman Problem, the authors have created a resource intended for researchers, educators and students. The recognition concerns both the technical content of the publication and its accessibility: the announcement specifically credited the book with making complex optimization methods accessible to future generations.

Traub is an associate professor in the Department of Computer Science at ETH Zurich and a mathematician and theoretical computer scientist whose research includes approximation algorithms and combinatorial optimization. Vygen is a professor of discrete mathematics at the University of Bonn whose extensive contributions to combinatorial optimization include applications in chip design and vehicle routing. Their work addresses a central problem in operations research while also reflecting their respective backgrounds in theoretical computer science, discrete mathematics and combinatorial optimization.

The Lanchester Prize is named for Frederick W. Lanchester, a British engineer whose pioneering use of mathematical models helped lay the foundations for modern operations research. INFORMS describes the 2026 award as recognition for an exceptional published contribution that advances both the theory and practice of the discipline. The announcement did not claim that the book resolves the Traveling Salesman Problem in every case, nor did it specify a guaranteed level of route quality. Its stated contributions were the original material, the strengthening of previous results, the unification of advances across different variations of the problem and the clear presentation of sophisticated mathematical methods. The prize therefore honors a published work that advances research in approximation algorithms and combinatorial optimization while serving as a teaching and reference resource for the field.

Subject of Research: A prize-winning book on approximation algorithms for Traveling Salesman Problems

Article Title: 2026 INFORMS Lanchester Prize honors groundbreaking book on the Traveling Salesman Problem

Article References: 2026 INFORMS Lanchester Prize honors groundbreaking book on the Traveling Salesman Problem. Original publication (Bibliographic details unavailable.)

Image Credits: AI Generated

DOI: Not provided

Keywords: INFORMS, Lanchester Prize, Traveling Salesman Problem, approximation algorithms, combinatorial optimization, operations research, routing, theoretical computer science, mathematics, ETH Zurich, University of Bonn, Lanchester