IJOC Meritorious Papers

In 2020, the INFORMS Journal on Computing implemented the Meritorious Paper Award to honor that rare paper that is truly superior. These papers are nominated by IJOC editors or reviewers and concurred by the Area Editor and the EIC.


2025 Awardee


A New Upper Bound for the Euclidean TSP Constant
John Gunnar Carlsson, Julien Yu
Volume 38, Issue 2, March-April 2026
https://doi.org/10.1287/ijoc.2024.0538


2024 Awardee


An Efficient Node Selection Policy for Monte Carlo Tree Search with Neural Networks
Xiaotian Liu, Yijie Peng, Gongbo Zhang, Ruihan Zhou
Volume 37, Issue 4, July-August 2025
https://doi.org/10.1287/ijoc.2023.0307


2021 Awardees


SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
Frank de Meijer, Renata Sotirov
Volume 33, Issue 4, Fall 2021
https://doi.org/10.1287/ijoc.2021.1075

Conflict Analysis for MINLP
Timo Berthold, Jakob Witzig
Volume 33, Issue 2, Spring 2021
https://doi.org/10.1287/ijoc.2020.1050

Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
Dominik Goeke, Michael Schneider
Volume 33, Issue 2, Spring 2021
https://doi.org/10.1287/ijoc.2020.1040

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.