Ted K. Ralphs

36 papers B 1C 1Misc 1Journal 29Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Counterfactual Explanations for Integer Optimization Problems.
CoRR
Felix Engelhardt, Jannis Kurtz, S. Ilker Birbil, Ted K. Ralphs
2025 J jnl
Improving Directions in Mixed Integer Bilevel Linear Optimization.
CoRR
Federico Battista, Ted K. Ralphs
2025 J jnl
Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems.
CoRR
Sahar Tahernejad, Ted K. Ralphs
2024 J jnl
Introduction to the Special Section on Software Tools for Vehicle Routing.
INFORMS J. Comput.
Nicholas D. Kullman, Jorge E. Mendoza, Ted K. Ralphs
2024 J jnl
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem.
Math. Methods Oper. Res.
Samira Fallah, Ted K. Ralphs, Natashia L. Boland
2023 J jnl
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds.
Math. Program. Comput.
Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs
2022 J jnl
A framework for generalized Benders' decomposition and its application to multilevel optimization.
Math. Program.
Suresh Bolusani, Ted K. Ralphs
2022 J jnl
Special Issue of
INFORMS J. Comput.
J. Paul Brooks, Ted K. Ralphs, Nicola Secomandi
2021 J jnl
A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementation.
CoRR
Sahar Tahernejad, Ted K. Ralphs, Scott T. DeNegre
2021 J jnl
A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization.
CoRR
Suresh Bolusani, Stefano Coniglio, Ted K. Ralphs, Sahar Tahernejad
2021 J jnl
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms.
CoRR
Stephen J. Maher, Ted K. Ralphs, Yuji Shinano
2021 J jnl
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput.
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, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
2021 J jnl
On the Complexity of Inverse Mixed Integer Linear Optimization.
CoRR
Aykut Bulut, Ted K. Ralphs
2021 J jnl
On the Complexity of Inverse Mixed Integer Linear Optimization.
SIAM J. Optim.
Aykut Bulut, Ted K. Ralphs
2020 J jnl
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation.
Math. Program. Comput.
Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre
2018 — ch.
Parallel Solvers for Mixed Integer Linear Optimization.
Handbook of Parallel Constraint Reasoning
Ted K. Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch
2017 J jnl
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim.
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
2017 — conf
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization.
OR
Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy
2014 J jnl
Bilevel programming and the separation problem.
Math. Program.
Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger
2013 B conf
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization.
CPAIOR
Jiadong Wang, Ted K. Ralphs
2013 J jnl
On families of quadratic surfaces having fixed intersections with two hyperplanes.
Discret. Appl. Math.
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
2012 J jnl
Could we use a million cores to solve an integer program?
Math. Methods Oper. Res.
Thorsten Koch, Ted K. Ralphs, Yuji Shinano
2011 J jnl
MIPLIB 2010.
Math. Program. Comput.
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
2010 J jnl
On the Complexity of Selecting Disjunctions in Integer Programming.
SIAM J. Optim.
Ashutosh Mahajan, Ted K. Ralphs
2009 C conf
Bilevel Programming and Maximally Violated Valid Inequalities.
CTW
Andrea Lodi, Ted K. Ralphs
2009 J jnl
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS J. Comput.
Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2006 J jnl
An improved algorithm for solving biobjective integer programs.
Ann. Oper. Res.
Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek
2006 J jnl
Decomposition and Dynamic Cut Generation in Integer Linear Programming.
Math. Program.
Ted K. Ralphs, Matthew V. Galati
2004 J jnl
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
J. Supercomput.
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2003 J jnl
On the capacitated vehicle routing problem.
Math. Program.
Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.
2003 J jnl
Parallel branch and cut for capacitated vehicle routing.
Parallel Comput.
Ted K. Ralphs
2003 J jnl
Parallel branch, cut, and price for large-scale discrete optimization.
Math. Program.
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
2002 Misc conf
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
International Conference on Computational Science (1)
Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman
2001 — conf
Branch, Cut, and Price: Sequential and Parallel.
Computational Combinatorial Optimization
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
1997 — conf
Fully Parallel Generic Branch-and-Cut.
PP
Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
1993 J jnl
On the mixed Chinese postman problem.
Oper. Res. Lett.
Ted K. Ralphs