Ted K. Ralphs

Orcid: 0000-0002-4306-9089

Affiliations:
  • Lehigh University, Bethlehem, PA, USA


According to our database1, Ted K. Ralphs authored at least 32 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem.
Math. Methods Oper. Res., August, 2024

Introduction to the Special Section on Software Tools for Vehicle Routing.
INFORMS J. Comput., 2024

2023
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds.
Math. Program. Comput., March, 2023

2022
A framework for generalized Benders' decomposition and its application to multilevel optimization.
Math. Program., 2022

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

2021
On the Complexity of Inverse Mixed Integer Linear Optimization.
SIAM J. Optim., 2021

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

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

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

2020
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation.
Math. Program. Comput., 2020

2018
Preface.
Optim. Methods Softw., 2018

Parallel Solvers for Mixed Integer Linear Optimization.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim., 2017

Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization.
Proceedings of the Operations Research Proceedings 2017, 2017

2014
Bilevel programming and the separation problem.
Math. Program., 2014

2013
On families of quadratic surfaces having fixed intersections with two hyperplanes.
Discret. Appl. Math., 2013

Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization.
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?
Math. Methods Oper. Res., 2012

2011
MIPLIB 2010.
Math. Program. Comput., 2011

2010
On the Complexity of Selecting Disjunctions in Integer Programming.
SIAM J. Optim., 2010

2009
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS J. Comput., 2009

Bilevel Programming and Maximally Violated Valid Inequalities.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2006
Decomposition and Dynamic Cut Generation in Integer Linear Programming.
Math. Program., 2006

An improved algorithm for solving biobjective integer programs.
Ann. Oper. Res., 2006

2004
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
J. Supercomput., 2004

2003
Parallel branch and cut for capacitated vehicle routing.
Parallel Comput., 2003

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

On the capacitated vehicle routing problem.
Math. Program., 2003

2002
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
Proceedings of the Computational Science - ICCS 2002, 2002

2001
Branch, Cut, and Price: Sequential and Parallel.
Proceedings of the Computational Combinatorial Optimization, 2001

1997
Fully Parallel Generic Branch-and-Cut.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1993
On the mixed Chinese postman problem.
Oper. Res. Lett., 1993


  Loading...