On the mixed Chinese postman problem. - Ted K. Ralphs (Oper. Res. Lett., 1993)

Fully Parallel Generic Branch-and-Cut. - Marta Eso; Laszlo Ladányi; Ted K. Ralphs; Leslie E. Trotter Jr. (PP, 1997)

Branch, Cut, and Price: Sequential and Parallel. - Laszlo Ladányi; Ted K. Ralphs; Leslie E. Trotter Jr. (Computational Combinatorial Optimization, 2001)

Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications. - Laszlo Ladányi; Ted K. Ralphs; Matthew J. Saltzman (International Conference on Computational Science (1), 2002)

On the capacitated vehicle routing problem. - Ted K. Ralphs; L. Kopman; William R. Pulleyblank; Leslie E. Trotter Jr. (Math. Program., 2003)

Parallel branch, cut, and price for large-scale discrete optimization. - Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (Math. Program., 2003)

Parallel branch and cut for capacitated vehicle routing. - Ted K. Ralphs (Parallel Comput., 2003)

A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. - Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (J. Supercomput., 2004)

An improved algorithm for solving biobjective integer programs. - Ted K. Ralphs; Matthew J. Saltzman; Margaret M. Wiecek (Ann. Oper. Res., 2006)

Decomposition and Dynamic Cut Generation in Integer Linear Programming. - Ted K. Ralphs; Matthew V. Galati (Math. Program., 2006)

Bilevel Programming and Maximally Violated Valid Inequalities. - Andrea Lodi 001; Ted K. Ralphs (CTW, 2009)

Computational Experience with a Software Framework for Parallel Integer Programming. - Y. Xu; Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (INFORMS J. Comput., 2009)

On the Complexity of Selecting Disjunctions in Integer Programming. - Ashutosh Mahajan; Ted K. Ralphs (SIAM J. Optim., 2010)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

Could we use a million cores to solve an integer program? - Thorsten Koch; Ted K. Ralphs; Yuji Shinano (Math. Methods Oper. Res., 2012)

Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization. - Jiadong Wang; Ted K. Ralphs (CPAIOR, 2013)

On families of quadratic surfaces having fixed intersections with two hyperplanes. - Pietro Belotti; Julio Cesar Goez; Imre Pólik; Ted K. Ralphs; Tamás Terlaky (Discret. Appl. Math., 2013)

Bilevel programming and the separation problem. - Andrea Lodi 001; Ted K. Ralphs; Gerhard J. Woeginger (Math. Program., 2014)

Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization. - Matthias Miltenberger; Ted K. Ralphs; Daniel E. Steffy (OR, 2017)

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. - Pietro Belotti; Julio Cesar Goez; Imre Pólik; Ted K. Ralphs; Tamás Terlaky (Discret. Optim., 2017)

Parallel Solvers for Mixed Integer Linear Optimization. - Ted K. Ralphs; Yuji Shinano; Timo Berthold; Thorsten Koch (Handbook of Parallel Constraint Reasoning, 2018)

Preface. - Ambros M. Gleixner; Christian Kirches; John Mitchell; Theodore K. Ralphs (Optim. Methods Softw., 2018)

A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. - Sahar Tahernejad; Ted K. Ralphs; Scott DeNegre (Math. Program. Comput., 2020)

A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization. - Suresh Bolusani; Stefano Coniglio; Ted K. Ralphs; Sahar Tahernejad (CoRR, 2021)

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms. - Stephen J. Maher; Ted K. Ralphs; Yuji Shinano (CoRR, 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

On the Complexity of Inverse Mixed Integer Linear Optimization. - Aykut Bulut; Ted K. Ralphs (SIAM J. Optim., 2021)

Special Issue of INFORMS Journal on Computing - Scalable Reinforcement Learning Algorithms. - J. Paul Brooks; Ted K. Ralphs; Nicola Secomandi (INFORMS J. Comput., 2022)

A framework for generalized Benders' decomposition and its application to multilevel optimization. - Suresh Bolusani; Ted K. Ralphs (Math. Program., 2022)

Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds. - Xueyu Shi; Oleg A. Prokopyev; Ted K. Ralphs (Math. Program. Comput., 2023)

Introduction to the Special Section on Software Tools for Vehicle Routing. - Nicholas D. Kullman; Jorge E. Mendoza; Ted K. Ralphs (INFORMS J. Comput., 2024)

On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. - Samira Fallah; Ted K. Ralphs; Natashia L. Boland (Math. Methods Oper. Res., 2024)