Glover-Klingman Prize

The Glover-Klingman Prize is awarded each year to an individual or a group for the best paper published in Networks. Each co-author of the winning paper will receive a certificate and a cash award.

Fred Glover and Darwin Klingman (1944-1989) published more than 100 articles on the innovative implementation of network optimization algorithms. Their goal was to reduce computation time and memory requirements, thereby enabling solution of the larger, more realistic problems that confronted and continue to confront practitioners. In their joint work, they developed special list structures, labeling techniques, and clever hybrid algorithms and successfully applied these ideas to a variety of network optimization problems.

The Glover-Klingman Prize pays tribute to the high quality of their work at the interface of operations research and computer science. The prize, however, is for outstanding work in the general area of network modeling, analysis, and implementation, and is not limited to papers at the OR/CS interface.

The Editors-in-Chief, with assistance from members of the Editorial Board of Networks, select the winners of this annual award.

Previous Awards:

2008:

Asaf Levin, Daniel Paulusma and Gerhard Woeginger for their pair of papers "The Computational Complexity of Graph Contractions I, II," Networks, Volume 51, Issue 3, May 2008, pp. 178-189 and Volume 52, Issue 1, August 2008, pp. 32-56.

2007:

Walid Ben-Ameur and José Neto for their paper "Acceleration of Cutting-Plane and Column Generation Algorithms: Applications to Network Design," Networks, Volume 49, Issue 1, January 2007, pp. 3-17.

2006:

Andreas S. Schulz and Nicolás E. Stier-Moses for their paper "Efficiency and Fairness of System-Optimal Routing with User Constraints," Networks, Volume 48, Issue 4, December 2006, pp. 223-234.

2005:

Thomas L. Magnanti and S. Raghavan for their paper "Strong Formulations for Network Design Problems with Connectivity Requirements," Networks, Volume 45, Issue 2, March 2005, pp. 61-79.

2004:

Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, and Juan José Salazar González for their paper "The Ring Star Problem: Polyhedral Analysis and Exact Algorithm," Networks, Volume 43, Issue 3, May 2004, pp. 177-189.

2003:

Irina Dumitrescu and Natashia Boland for their paper "Improved Preprocessing, Labeling and Scaling Algorithms for the Weight-Constrained Shortest Path Problem," Networks, Volume 42, Issue 3, October 2003, pp. 135-153.