default search action
Ted K. Ralphs
Person information
- affiliation: Lehigh University, Bethlehem, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Nicholas D. Kullman, Jorge E. Mendoza, Ted K. Ralphs:
Introduction to the Special Section on Software Tools for Vehicle Routing. INFORMS J. Comput. 36(4): 941-942 (2024) - [j22]Samira Fallah, Ted K. Ralphs, Natashia L. Boland:
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. Math. Methods Oper. Res. 100(1): 175-220 (2024) - 2023
- [j21]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): 1-51 (2023) - 2022
- [j20]J. Paul Brooks, Ted K. Ralphs, Nicola Secomandi:
Special Issue of INFORMS Journal on Computing - Scalable Reinforcement Learning Algorithms. INFORMS J. Comput. 34(1): 2-3 (2022) - [j19]Suresh Bolusani, Ted K. Ralphs:
A framework for generalized Benders' decomposition and its application to multilevel optimization. Math. Program. 196(1): 389-426 (2022) - 2021
- [j18]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): 443-490 (2021) - [j17]Aykut Bulut, Ted K. Ralphs:
On the Complexity of Inverse Mixed Integer Linear Optimization. SIAM J. Optim. 31(4): 3014-3043 (2021) - [i4]Aykut Bulut, Ted K. Ralphs:
On the Complexity of Inverse Mixed Integer Linear Optimization. CoRR abs/2104.09002 (2021) - [i3]Suresh Bolusani, Stefano Coniglio, Ted K. Ralphs, Sahar Tahernejad:
A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization. CoRR abs/2104.09003 (2021) - [i2]Sahar Tahernejad, Ted K. Ralphs, Scott T. DeNegre:
A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementation. CoRR abs/2104.09010 (2021) - [i1]Stephen J. Maher, Ted K. Ralphs, Yuji Shinano:
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms. CoRR abs/2104.10025 (2021) - 2020
- [j16]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): 529-568 (2020)
2010 – 2019
- 2018
- [j15]Ambros M. Gleixner, Christian Kirches, John Mitchell, Theodore K. Ralphs:
Preface. Optim. Methods Softw. 33(3): 419 (2018) - [p1]Ted K. Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch:
Parallel Solvers for Mixed Integer Linear Optimization. Handbook of Parallel Constraint Reasoning 2018: 283-336 - 2017
- [j14]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: 3-31 (2017) - [c6]Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy:
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization. OR 2017: 151-157 - 2014
- [j13]Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger:
Bilevel programming and the separation problem. Math. Program. 146(1-2): 437-458 (2014) - 2013
- [j12]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): 2778-2793 (2013) - [c5]Jiadong Wang, Ted K. Ralphs:
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization. CPAIOR 2013: 394-402 - 2012
- [j11]Thorsten Koch, Ted K. Ralphs, Yuji Shinano:
Could we use a million cores to solve an integer program? Math. Methods Oper. Res. 76(1): 67-93 (2012) - 2011
- [j10]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): 103-163 (2011) - 2010
- [j9]Ashutosh Mahajan, Ted K. Ralphs:
On the Complexity of Selecting Disjunctions in Integer Programming. SIAM J. Optim. 20(5): 2181-2198 (2010)
2000 – 2009
- 2009
- [j8]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): 383-397 (2009) - [c4]Andrea Lodi, Ted K. Ralphs:
Bilevel Programming and Maximally Violated Valid Inequalities. CTW 2009: 125-134 - 2006
- [j7]Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek:
An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147(1): 43-70 (2006) - [j6]Ted K. Ralphs, Matthew V. Galati:
Decomposition and Dynamic Cut Generation in Integer Linear Programming. Math. Program. 106(2): 261-285 (2006) - 2004
- [j5]Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. J. Supercomput. 28(2): 215-234 (2004) - 2003
- [j4]Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.:
On the capacitated vehicle routing problem. Math. Program. 94(2-3): 343-359 (2003) - [j3]Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
Parallel branch, cut, and price for large-scale discrete optimization. Math. Program. 98(1-3): 253-280 (2003) - [j2]Ted K. Ralphs:
Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29(5): 607-629 (2003) - 2002
- [c3]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: 592-602 - 2001
- [c2]Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:
Branch, Cut, and Price: Sequential and Parallel. Computational Combinatorial Optimization 2001: 223-260
1990 – 1999
- 1997
- [c1]Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:
Fully Parallel Generic Branch-and-Cut. PP 1997 - 1993
- [j1]Ted K. Ralphs:
On the mixed Chinese postman problem. Oper. Res. Lett. 14(3): 123-127 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint