Ted K. Ralphs

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 11

Top Topics

Totally Unimodular

Optimization Problems

Top Venues

Math. Program. Comput.

Publications

Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds. Math. Program. Comput. 15 (1) (2023)
Suresh Bolusani, Ted K. Ralphs
A framework for generalized Benders' decomposition and its application to multilevel optimization. Math. Program. 196 (1) (2022)
Sahar Tahernejad, Ted K. Ralphs, Scott T. DeNegre
A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementation. CoRR (2021)
Aykut Bulut, Ted K. Ralphs
On the Complexity of Inverse Mixed Integer Linear Optimization. CoRR (2021)
Aykut Bulut, Ted K. Ralphs
On the Complexity of Inverse Mixed Integer Linear Optimization. SIAM J. Optim. 31 (4) (2021)
Stephen J. Maher, Ted K. Ralphs, Yuji Shinano
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms. CoRR (2021)
Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13 (3) (2021)
Suresh Bolusani, Stefano Coniglio, Ted K. Ralphs, Sahar Tahernejad
A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization. CoRR (2021)
Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12 (4) (2020)
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. Discret. Optim. 24 (2017)
Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization. OR (2017)
Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger
Bilevel programming and the separation problem. Math. Program. 146 (1-2) (2014)
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
On families of quadratic surfaces having fixed intersections with two hyperplanes. Discret. Appl. Math. 161 (16-17) (2013)
Jiadong Wang, Ted K. Ralphs
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization. CPAIOR (2013)
Thorsten Koch, Ted K. Ralphs, Yuji Shinano
Could we use a million cores to solve an integer program? Math. Methods Oper. Res. 76 (1) (2012)
Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter
MIPLIB 2010. Math. Program. Comput. 3 (2) (2011)
Ashutosh Mahajan, Ted K. Ralphs
On the Complexity of Selecting Disjunctions in Integer Programming. SIAM J. Optim. 20 (5) (2010)
Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
Computational Experience with a Software Framework for Parallel Integer Programming. INFORMS J. Comput. 21 (3) (2009)
Andrea Lodi, Ted K. Ralphs
Bilevel Programming and Maximally Violated Valid Inequalities. CTW (2009)
Ted K. Ralphs, Matthew V. Galati
Decomposition and Dynamic Cut Generation in Integer Linear Programming. Math. Program. 106 (2) (2006)
Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek
An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147 (1) (2006)
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. J. Supercomput. 28 (2) (2004)
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
Parallel branch, cut, and price for large-scale discrete optimization. Math. Program. 98 (1-3) (2003)
Ted K. Ralphs
Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29 (5) (2003)
Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.
On the capacitated vehicle routing problem. Math. Program. 94 (2-3) (2003)
Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications. International Conference on Computational Science (1) (2002)
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
Branch, Cut, and Price: Sequential and Parallel. Computational Combinatorial Optimization (2001)
Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
Fully Parallel Generic Branch-and-Cut. PPSC (1997)
Ted K. Ralphs
On the mixed Chinese postman problem. Oper. Res. Lett. 14 (3) (1993)