Ted K. Ralphs

According to our database, Ted K. Ralphs authored at least 30 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds.

Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs

Math. Program. Comput., March, 2023

2022

A framework for generalized Benders' decomposition and its application to multilevel optimization.

Suresh Bolusani, Ted K. Ralphs

Math. Program., 2022

Special Issue of <i>INFORMS Journal on Computing</i> - Scalable Reinforcement Learning Algorithms.

J. Paul Brooks, Ted K. Ralphs, Nicola Secomandi

INFORMS J. Comput., 2022

2021

On the Complexity of Inverse Mixed Integer Linear Optimization.

Aykut Bulut, Ted K. Ralphs

SIAM J. Optim., 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 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

Math. Program. Comput., 2021

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms.

Stephen J. Maher, Ted K. Ralphs, Yuji Shinano

CoRR, 2021

A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization.

Suresh Bolusani, Stefano Coniglio, Ted K. Ralphs, Sahar Tahernejad

CoRR, 2021

2020

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

2018

Preface.

Ambros M. Gleixner, Christian Kirches, John Mitchell, Theodore K. Ralphs

Optim. Methods Softw., 2018

Parallel Solvers for Mixed Integer Linear Optimization.

Ted K. Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

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

Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization.

Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy

Proceedings of the Operations Research Proceedings 2017, 2017

2014

Bilevel programming and the separation problem.

Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger

Math. Program., 2014

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

Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization.

Jiadong Wang, Ted K. Ralphs

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

Could we use a million cores to solve an integer program?

Thorsten Koch, Ted K. Ralphs, Yuji Shinano

Math. Methods Oper. Res., 2012

2011

MIPLIB 2010.

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

Math. Program. Comput., 2011

2010

On the Complexity of Selecting Disjunctions in Integer Programming.

Ashutosh Mahajan, Ted K. Ralphs

SIAM J. Optim., 2010

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

Bilevel Programming and Maximally Violated Valid Inequalities.

Andrea Lodi, Ted K. Ralphs

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2006

Decomposition and Dynamic Cut Generation in Integer Linear Programming.

Ted K. Ralphs, Matthew V. Galati

Math. Program., 2006

An improved algorithm for solving biobjective integer programs.

Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek

Ann. Oper. Res., 2006

2004

A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.

Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman

J. Supercomput., 2004

2003

Parallel branch and cut for capacitated vehicle routing.

Ted K. Ralphs

Parallel Comput., 2003

Parallel branch, cut, and price for large-scale discrete optimization.

Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman

Math. Program., 2003

On the capacitated vehicle routing problem.

Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.

Math. Program., 2003

2002

Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.

Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Branch, Cut, and Price: Sequential and Parallel.

Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.

Proceedings of the Computational Combinatorial Optimization, 2001

1997

Fully Parallel Generic Branch-and-Cut.

Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1993

On the mixed Chinese postman problem.

Ted K. Ralphs

Oper. Res. Lett., 1993