Ted Ralphs

Publications

Click here to see my pubs on Zotero

Student Doctoral Dissertations

S. Tahernejad, “Two-stage mixed integer stochastic bilevel linear optimization,” PhD Thesis, 2019. [Bibtex]

@phdthesis{Tahernejad2019,
author = {Tahernejad, S.},
school = {Lehigh University},
title = {Two-stage Mixed Integer Stochastic Bilevel Linear Optimization},
year = {2019}
}

S. Bolusani, “Parametric valid inequalities and their application in multilevel optimization,” PhD Thesis, 2019 (Expected). [Bibtex]

@phdthesis{Bolusani2021,
author = {Bolusani, S.},
school = {Lehigh University},
title = {Parametric Valid Inequalities and Their Application in Multilevel Optimization},
year = {2019 (Expected)}
}

A. Bulut, “Computational Methods for Discrete Conic Optimization Problems,” PhD Thesis, 2017. [Bibtex]

@phdthesis{Bulut2017,
author = {Bulut, A.},
school = {Lehigh},
title = {{Computational Methods for Discrete Conic Optimization Problems}},
year = {2017}
}

A. Hassanzadeh, “Two-Stage Stochastic Mixed Integer Optimization,” PhD Thesis, 2015. [Bibtex]

@phdthesis{Hassanzadeh2015,
author = {Hassanzadeh, A.},
school = {Lehigh},
title = {{Two-Stage Stochastic Mixed Integer Optimization}},
year = {2015}
}

S. T. DeNegre, “Interdiction and Discrete Bilevel Linear Programming,” PhD Thesis, 2011. [PDF] [Bibtex]

@phdthesis{SDeNegre2011,
author = {DeNegre, S.T.},
school = {Lehigh University},
title = {{Interdiction and Discrete Bilevel Linear Programming}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ScottDeNegreDissertation11.pdf},
year = {2011}
}

A. Mahajan, “On Selecting Disjunctions in Mixed Integer Linear Programming,” PhD Thesis, 2009. [PDF] [Bibtex]

@phdthesis{Mahajan2009,
author = {Mahajan, A.},
school = {Lehigh University},
title = {{On Selecting Disjunctions in Mixed Integer Linear Programming}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/AshutoshMahajanDissertation09.pdf},
year = {2009}
}

Z. Akca, “Integrated Location, Routing, and Scheduling Problems: Models and Algorithms,” PhD Thesis, 2009. [PDF] [Bibtex]

@phdthesis{Akca2009,
author = {Akca, Z.},
school = {Lehigh University},
title = {{Integrated Location, Routing, and Scheduling Problems: Models and Algorithms}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ZelihaAkcaDissertation09.pdf},
year = {2009}
}

M. V. Galati, “Decomposition in Integer Programming,” PhD Thesis, 2009. [PDF] [Bibtex]

@phdthesis{Galati2009,
author = {Galati, M.V.},
school = {Lehigh University},
title = {{Decomposition in Integer Programming}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MatthewGalatiDissertation09.pdf},
year = {2009}
}

M. Güzelsoy, “Dual Methods in Mixed Integer Linear Programming,” PhD Thesis, 2009. [PDF] [Bibtex]

@phdthesis{Guzelsoy2009,
author = {G{\"{u}}zelsoy, M.},
school = {Lehigh University},
title = {{Dual Methods in Mixed Integer Linear Programming}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MenalGuzelsoyDissertation09.pdf},
year = {2009}
}

Y. Xu, “Scalable Algorithms for Parallel Tree Search,” PhD Thesis, 2007. [PDF] [Bibtex]

@phdthesis{Xu2007,
author = {Xu, Y.},
school = {Lehigh University},
title = {{Scalable Algorithms for Parallel Tree Search}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/YanXuDissertation07.pdf},
year = {2007}
}

Software

Towhidi, M., Orban, D., & Ralphs, T. K.. (2021). CyLP 0.91. . [Software] [DOI] [Bibtex]

@Misc{ TowOrbRal21,
author  = {Towhidi, M. and Orban, D. and Ralphs, T.K.},
doi = {10.5281/zenodo.4679739},
title = {{CyLP 0.91}},
software  = {https://github.com/coin-or/CyLP},
year = {2021}
}

Xu, Y., Ralphs, T. K., Ladányi, L., & Saltzman, M. J.. (2020). BiCEPs Version 0.99. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ XuRalLadSal20b,
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
doi = {10.5281/zenodo.2595520},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{BiCEPs Version 0.99}},
software  = {https://github.com/coin-or/CHiPPS-ALPS},
year = {2020}
}

Ralphs, T. K., & Bulut, A.. (2020). GrUMPy Version 0.95. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ RalBul20a,
author  = {Ralphs, T.K. and Bulut, A.},
doi = {10.5281/zenodo.3750218},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{GrUMPy Version 0.95}},
software  = {https://github.com/coin-or/GrUMPy},
year = {2020}
}

Xu, Y., Ralphs, T. K., Ladányi, L., & Saltzman, M. J.. (2020). BLIS Version 0.95. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ XuRalLadSal20a,
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
doi = {10.5281/zenodo.2595523},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{BLIS Version 0.95}},
software  = {https://github.com/coin-or/CHiPPS-BLIS},
year = {2020}
}

Xu, Y., Ralphs, T. K., Ladányi, L., & Saltzman, M. J.. (2020). ALPS Version 2.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ XuRalLadSal20,
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
doi = {10.5281/zenodo.2576602},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{ALPS Version 2.0}},
software  = {https://github.com/coin-or/CHiPPS-ALPS},
year = {2020}
}

DeNegre, S. T., Tahernejad, S., & Ralphs, T. K.. (2020). MiBS Version 1.2. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ DeNTahRal20,
author  = {DeNegre, S.T. and Tahernejad, S. and Ralphs, T.K.},
doi = {10.5281/zenodo.3560359},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{MiBS Version 1.2}},
software  = {https://github.com/coin-or/MiBS},
year = {2020}
}

Galati, M. V., Ralphs, T. K., & Wang, J.. (2020). Dip Version 0.95. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ GalRalWan20,
author  = {Galati, M.V. and Ralphs, T.K. and Wang, J.},
doi = {10.5281/zenodo.3609339},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{Dip Version 0.95}},
software  = {http://github.com/coin-or.org/Dip},
year = {2020}
}

Ralphs, T. K., Vigerske, S., & Waechter, A.. (2020). COIN-OR Build Tools 0.8. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ RalVigWae20,
author  = {Ralphs, T.K. and Vigerske, S. and Waechter, A.},
doi = {10.5281/zenodo.3632431},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{COIN-OR Build Tools 0.8}},
software  = {https://github.com/coin-or-tools/BuildTools/},
year = {2020}
}

Ralphs, T. K.. (2020). CuPPy Version 0.96. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ Ral20,
author  = {Ralphs, T.K.},
doi = {10.5281/zenodo.3820876},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{CuPPy Version 0.96}},
software  = {https://github.com/tkralphs/CuPPy},
year = {2020}
}

Ralphs, T. K., Guzelsoy, M., & Mahajan, A.. (2020). SYMPHONY Version 5.6. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ RalGuzMah20,
author  = {Ralphs, T.K. and Guzelsoy, M. and Mahajan, A.},
doi = {10.5281/zenodo.2656802},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{SYMPHONY Version 5.6}},
software  = {https://github.com/coin-or/SYMPHONY/},
year = {2020}
}

Ralphs, T. K., & Bulut, A.. (2020). GiMPy Version 2.1. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ RalBul20,
author  = {Ralphs, T.K. and Bulut, A.},
doi = {10.5281/zenodo.3750217},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{GiMPy Version 2.1}},
software  = {https://github.com/coin-or/GiMPy},
year = {2020}
}

Ralphs, T. K., & Bulut, A.. (2019). BLImPy Version 2.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ RalBul19,
author  = {Ralphs, T.K. and Bulut, A.},
doi = {10.5281/zenodo.3609324},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{BLImPy Version 2.0}},
software  = {https://github.com/tkralphs/BLImPy},
year = {2019}
}

Bulut, A., & Ralphs, T. K.. (2018). DisCO Version 1.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ BulRal18,
author  = {Bulut, A. and Ralphs, T.K.},
doi = {10.5281/zenodo.2691031},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{DisCO Version 1.0}},
software  = {https://github.com/coin-or/DisCO},
year = {2018}
}

Bulut, A., & Ralphs, T. K.. (2017). OSI-CONIC 1.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ BulRal17,
author  = {Bulut, A. and Ralphs, T.K.},
doi = {10.5281/zenodo.1147182},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{OSI-CONIC 1.0}},
software  = {https://github.com/aykutbulut/OSI-CONIC},
year = {2017}
}

Bulut, A., & Ralphs, T. K.. (2017). CGL-CONIC 1.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ BulRal17b,
author  = {Bulut, A. and Ralphs, T.K.},
doi = {10.5281/zenodo.1147189},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{CGL-CONIC 1.0}},
software  = {https://github.com/aykutbulut/CGL-CONIC},
year = {2017}
}

Bulut, A., & Ralphs, T. K.. (2017). COLA 1.0. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ BulRal17a,
author  = {Bulut, A. and Ralphs, T.K.},
doi = {10.5281/zenodo.1147184},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{COLA 1.0}},
software  = {https://github.com/aykutbulut/COLA},
year = {2017}
}

et.al. Ralphs, T. K.. (2016). COIN-OR Optimization Suite 1.9. Cor@l laboratory, lehigh university. [Software] [DOI] [Bibtex]

@Misc{ Ral16,
author  = {et.al. Ralphs, T.K.},
doi = {10.5281/zenodo.246111},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{COIN-OR Optimization Suite 1.9}},
software  = {https://github.com/coin-or/COIN-OR-OptimizationSuite},
year = {2016}
}

Bulut, A., & Ralphs, T. K.. (2015). DietCOLA. Cor@l laboratory, lehigh university. [Software] [Bibtex]

@Misc{ BulRal15,
author  = {Bulut, A. and Ralphs, T.K.},
publisher  = {COR@L Laboratory, Lehigh University},
title = {{DietCOLA}},
software  = {https://github.com/aykutbulut/DietCOLA},
year = {2015}
}

Papers and Tech Reports

2024

F. Battista and T. K. Ralphs, “A branch-and-cut algorithm for bilevel linear optimization based on improving directions,” Working Paper, COR@L Laboratory, Lehigh University 2024. [Bibtex]

@TechReport{ BatRal24,
title = {A Branch-and-Cut Algorithm for Bilevel Linear Optimization
Based on Improving Directions},
author  = {Battista, F. and Ralphs, T.K.},
year = {2024},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

S. Coniglio and T. K. Ralphs, “Bound-optimal cuts: On the generation of cuts which maximize the bound improvement,” Working Paper, COR@L Laboratory, Lehigh University 2024. [Bibtex]

@TechReport{ ConRal24,
title = {Bound-Optimal Cuts: {{On}} the Generation of Cuts Which
Maximize the Bound Improvement},
author  = {Coniglio, S. and Ralphs, T.K.},
year = {2024},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

S. Fallah, T. K. Ralphs, and N. Boland, “On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem,” Mathematical methods of operations research, 2024. [PDF] [DOI] [Bibtex]

@Article{ FalRalBol24,
title = {On the Relationship between the Value Function and the
Efficient Frontier of a Mixed Integer Linear Optimization
Problem},
author  = {Fallah, Samira and Ralphs, Ted K. and Boland, Natashia
L.},
year = {2024},
journal  = {Mathematical Methods of Operations Research},
publisher  = {COR@L Laboratory, Lehigh University},
issn = {1432-2994},
doi = {10.1007/s00186-024-00871-2},
url = {https://arxiv.org/abs/2303.00785},
abstract  = {In this study, we investigate the connection between the
efficient frontier (EF) of a general multiobjective mixed
integer linear optimization problem (MILP) and the
so-called restricted value function (RVF) of a closely
related single-objective MILP. In the first part of the
paper, we detail the mathematical structure of the RVF,
including characterizing the set of points at which it is
differentiable, the gradients at such points, and the
subdifferential at all nondifferentiable points. We then
show that the EF of the multiobjective MILP is comprised of
points on the boundary of the epigraph of the RVF and that
any description of the EF suffices to describe the RVF and
vice versa. Because of the close relationship of the RVF to
the EF, we observe that methods for constructing the
so-called value function (VF) of an MILP and methods for
constructing the EF of a multiobjective optimization
problem are effectively interchangeable. Exploiting this
observation, we propose a generalized cutting-plane
algorithm for constructing the EF of a multiobjective MILP
that arises from an existing algorithm for constructing the
classical MILP VF. The algorithm identifies the set of all
integer parts of solutions on the EF. We prove that the
algorithm converges finitely under a standard boundedness
assumption and comes with a performance guarantee if
terminated early.},
note = {Appeared on-line only}
}

O. A. Prokopyev and T. K. Ralphs, “On the complexity of finding locally optimal solutions in bilevel linear programming,” COR@L Laboratory, Lehigh University, 24T-015, 2024. [PDF] [Bibtex]

@TechReport{ ProRal24,
title = {On the Complexity of Finding Locally Optimal Solutions in
Bilevel Linear Programming},
author  = {Prokopyev, O.A. and Ralphs, T.K.},
year = {2024},
number  = {24T-015},
institution  = {COR@L Laboratory, Lehigh University},
url = {https://coral.ise.lehigh.edu/~ted/files/papers/BLPLocal24.pdf}
}

T. K. Ralphs, “Duality, branch and bound, and parametric valid inequalities,” Working Paper, COR@L Laboratory, Lehigh University 2024. [PDF] [Bibtex]

@TechReport{ Ral24,
title = {Duality, Branch and Bound, and Parametric Valid
Inequalities},
author  = {Ralphs, T.K.},
year = {2024},
institution  = {Working Paper, COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/talks/ParametricInequalities-INFORMS17.pdf}
}

J. Thürauf, T. Kleinert, I. Ljubić, T. K. Ralphs, and M. Schmidt, “BOBILib: Bilevel optimization (benchmark) instance library,” 2024. [PDF] [Bibtex]

@TechReport{ ThuKleLjuRalSch24,
title = {{{BOBILib}}: {{Bilevel}} Optimization (Benchmark) Instance
Library},
author  = {Th{\"u}rauf, J. and Kleinert, T. and Ljubi{\'c}, I. and
Ralphs, T.K. and Schmidt, M.},
year = {2024},
url = {https://optimization-online.org/2024/07/bobilib-bilevel-optimization-benchmark-instance-library/}
}

Y. Xie, T. K. Ralphs, and O. A. Prokopyev, “A branch-and-cut algorithm for mixed integer bilevel optimization with bounded rationality,” Working Paper, COR@L Laboratory, Lehigh University 2024. [Bibtex]

@TechReport{ XieRalPro24,
title = {A Branch-and-Cut Algorithm for Mixed Integer Bilevel
Optimization with Bounded Rationality},
author  = {Xie, Yu and Ralphs, Ted K. and Prokopyev, Oleg A.},
year = {2024},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

2023

S. P. Kelley, A. M. Kazachkov, and T. K. Ralphs, “Warm starting of mixed integer linear optimization problems via parametric disjunctive cuts,” Working Paper, COR@L Laboratory, Lehigh University 2023. [Bibtex]

@TechReport{ KelKazRal23,
title = {Warm Starting of Mixed Integer Linear Optimization
Problems via Parametric Disjunctive Cuts},
author  = {Kelley, S.P. and Kazachkov, A.M. and Ralphs, T.K.},
year = {2023},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

T. K. Ralphs, M. Guzelsoy, and A. Mahajan, “SYMPHONY version 5.7 user’s manual,” COR@L Laboratory, Lehigh University 2023. [PDF] [Bibtex]

@TechReport{ RalGuzMah23,
title = {{{SYMPHONY}} Version 5.7 User's Manual},
author  = {Ralphs, T.K. and Guzelsoy, M. and Mahajan, A.},
year = {2023},
institution  = {COR@L Laboratory, Lehigh University},
url = {https://coin-or.github.io/SYMPHONY/doc/SYMPHONY-5.7.1-Manual.pdf}
}

2022

S. Bolusani and T. K. Ralphs, “A framework for generalized benders’ decomposition and its application to multilevel optimization,” Mathematical programming series b, vol. 196, p. 389–426, 2022. [PDF] [DOI] [Bibtex]

@Article{ BolRal22,
title = {A Framework for Generalized Benders' Decomposition and Its
Application to Multilevel Optimization},
author  = {Bolusani, S. and Ralphs, T.K.},
year = {2022},
journal  = {Mathematical Programming Series B},
volume  = {196},
pages = {389--426},
publisher  = {COR@L Laboratory Report 20T-001-R2, Lehigh University},
doi = {10.1007/s10107-021-01763-7},
url = {https://arxiv.org/abs/2104.06496}
}

T. K. Ralphs, M. Guzelsoy, and A. Mahajan, “SYMPHONY version 5.6 user’s manual,” COR@L Laboratory, Lehigh University 2022. [Software] [PDF] [Bibtex]

@TechReport{ RalGuzMah22,
title = {{{SYMPHONY}} Version 5.6 User's Manual},
author  = {Ralphs, T.K. and Guzelsoy, M. and Mahajan, A.},
year = {2022},
institution  = {COR@L Laboratory, Lehigh University},
url = {https://coin-or.github.io/SYMPHONY/doc/SYMPHONY-5.6.19-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

S. Xueyu, O. A. Prokopyev, and T. K. Ralphs, “Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds,” Mathematical programming computation, vol. 15, p. 1–51, 2022. [PDF] [DOI] [Bibtex]

@Article{ XueProRal22,
title = {Mixed Integer Bilevel Optimization with a K-Optimal
Follower: A Hierarchy of Bounds},
author  = {Xueyu, Shi and Prokopyev, Oleg A. and Ralphs, Ted K.},
year = {2022},
journal  = {Mathematical Programming Computation},
volume  = {15},
pages = {1--51},
publisher  = {COR@L Laboratory, Lehigh University},
doi = {10.1007/s12532-022-00227-z},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/HierarchyOfBounds20.pdf}
}

2021

A. Bulut and T. K. Ralphs, “On the complexity of inverse mixed integer linear optimization,” Siam journal on optimization, vol. 31, p. 3014–3043, 2021. [Software] [PDF] [DOI] [Bibtex]

@Article{ BulRal21,
title = {On the Complexity of Inverse Mixed Integer Linear
Optimization},
author  = {Bulut, A. and Ralphs, T.K.},
year = {2021},
journal  = {SIAM Journal on Optimization},
volume  = {31},
pages = {3014--3043},
publisher  = {COR@L Laboratory Report 15T-001-R5, Lehigh University},
doi = {10.1137/20M1377369},
url = {https://arxiv.org/abs/2104.09002},
software  = {https://github.com/tkralphs/CuPPy}
}

A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P. Christophel, K. Jarck, T. Koch, J. Linderoth, M. Luebbecke, H. D. Mittelmann, D. Ozyurt, T. K. Ralphs, Y. Shinano, and D. Salvagnin, “MIPLIB 2017: Data-driven compilation of the 6th mixed-integer programming library,” Mathematical programming computation, vol. 13, p. 443–490, 2021. [PDF] [DOI] [Bibtex]

@Article{ GleHenGamAchBasBerChrJarKocLin.ea21,
title = {{{MIPLIB}} 2017: {{Data-driven}} Compilation of the 6th
Mixed-Integer Programming Library},
author  = {Gleixner, Ambros and Hendel, Gregor and Gamrath, Gerald
and Achterberg, Tobias and Bastubbe, Michael and Berthold,
Timo and Christophel, Philipp and Jarck, Kati and Koch,
Thorsten and Linderoth, Jeffrey and Luebbecke, Marco and
Mittelmann, Hans D. and Ozyurt, Derya and Ralphs, Ted K.
and Shinano, Yuji and Salvagnin, Domenico},
year = {2021},
journal  = {Mathematical Programming Computation},
volume  = {13},
pages = {443--490},
publisher  = {Zuse Institute Berlin},
doi = {10.1007/s12532-020-00194-3},
url = {http://www.optimization-online.org/DB_FILE/2019/07/7285.pdf}
}

T. K. Ralphs, “Separation, inverse optimization, and decomposition,” Working Paper, COR@L Laboratory, Lehigh University 2021. [PDF] [Bibtex]

@TechReport{ Ral21,
title = {Separation, Inverse Optimization, and Decomposition},
author  = {Ralphs, T.K.},
year = {2021},
institution  = {Working Paper, COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/talks/InversePrimalSeparation-PKU18.pdf}
}

2020

S. Bolusani, S. Coniglio, T. K. Ralphs, and S. Tahernejad, “A unified framework for multistage mixed integer linear optimization,” in Bilevel Optimization: Advances and Next Challenges, S. Dempe and A. Zemkoho, Eds., Springer, 2020, p. 513–560. [PDF] [DOI] [Bibtex]

@InCollection{ BolConRalTah20,
title = {A Unified Framework for Multistage Mixed Integer Linear
Optimization},
booktitle  = {Bilevel {{Optimization}}: {{Advances}} and {{Next
Challenges}}},
author  = {Bolusani, S. and Coniglio, S. and Ralphs, T.K. and
Tahernejad, S.},
editor  = {Dempe, S. and Zemkoho, A.},
year = {2020},
pages = {513--560},
publisher  = {Springer},
doi = {10.1007/978-3-030-52119-6},
url = {https://arxiv.org/abs/2104.09003},
isbn = {978-3-030-52118-9}
}

S. Tahernejad and T. K. Ralphs, “Valid inequalities for mixed integer bilevel optimization problems,” COR@L Laboratory, Lehigh University, 20T-013, 2020. [Software] [PDF] [Bibtex]

@TechReport{ TahRal20,
title = {Valid Inequalities for Mixed Integer Bilevel Optimization
Problems},
author  = {Tahernejad, S. and Ralphs, T.K.},
year = {2020},
number  = {20T-013},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MibSCuts20.pdf},
software  = {https://github.com/coin-or/MibS}
}

S. Tahernejad, T. K. Ralphs, and S. T. DeNegre, “A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation,” Mathematical programming computation, vol. 12, p. 529–568, 2020. [Software] [PDF] [DOI] [Bibtex]

@Article{ TahRalDeN20,
title = {A Branch-and-Cut Algorithm for Mixed Integer Bilevel
Linear Optimization Problems and Its Implementation},
author  = {Tahernejad, S. and Ralphs, T.K. and DeNegre, S.T.},
year = {2020},
journal  = {Mathematical Programming Computation},
volume  = {12},
pages = {529--568},
doi = {10.1007/s12532-020-00183-6},
url = {https://arxiv.org/abs/2104.09010},
software  = {https://github.com/coin-or/MibS}
}

2019

S. J. Maher, T. K. Ralphs, and Y. Shinano, “Assessing the effectiveness of (parallel) branch-and-bound algorithms,” COR@L Laboratory, Lehigh University, 19T-017, 2019. [PDF] [Bibtex]

@TechReport{ MahRalShi19,
title = {Assessing the Effectiveness of (Parallel) Branch-and-Bound
Algorithms},
author  = {Maher, S.J. and Ralphs, T.K. and Shinano, Y.},
year = {2019},
number  = {19T-017},
institution  = {COR@L Laboratory, Lehigh University},
url = {https://arxiv.org/abs/2104.10025}
}

2018

T. K. Ralphs, Y. Shinano, T. Berthold, and T. Koch, “Parallel solvers for mixed integer linear programing,” in Handbook of Parallel Constraint Reasoning, Y. Hamadi and L. Sais, Eds., Springer berlin / heidelberg / cor@l laboratory, lehigh university, 2018, p. 283–336. [PDF] [DOI] [Bibtex]

@InCollection{ RalShiBerKoc18,
title = {Parallel Solvers for Mixed Integer Linear Programing},
booktitle  = {Handbook of {{Parallel Constraint Reasoning}}},
author  = {Ralphs, T.K. and Shinano, Y. and Berthold, T. and Koch,
T.},
editor  = {Hamadi, Y and Sais, L},
year = {2018},
pages = {283--336},
publisher  = {Springer Berlin / Heidelberg / COR@L Laboratory, Lehigh
University},
doi = {10.1007/978-3-319-63516-3_8},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ParallelMILPSurvey16.pdf}
}

M. Walter and T. K. Ralphs, “Algorithms for inverse mixed integer programming,” Working Paper, COR@L Laboratory, Lehigh University 2018. [Bibtex]

@TechReport{ WalRal18,
title = {Algorithms for Inverse Mixed Integer Programming},
author  = {Walter, M. and Ralphs, T.K.},
year = {2018},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

2017

A. Bulut and T. K. Ralphs, “Complexity for mathematical programs,” Working Paper, COR@L Laboratory, Lehigh University 2017. [PDF] [Bibtex]

@TechReport{ BulRal17,
title = {Complexity for Mathematical Programs},
author  = {Bulut, A. and Ralphs, T.K.},
year = {2017},
institution  = {Working Paper, COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/talks/MIP12.pdf}
}

A. Bulut and T. K. Ralphs, “DisCO: An open source solver for discrete conic optimization,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Software] [PDF] [Bibtex]

@TechReport{ BulRal17a,
title = {{{DisCO}}: {{An}} Open Source Solver for Discrete Conic
Optimization},
author  = {Bulut, A. and Ralphs, T.K.},
year = {2017},
institution  = {Working Paper, COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/talks/DisCO-INFORMS17.pdf},
software  = {https://github.com/aykutbulut/DisCO}
}

S. T. DeNegre and T. K. Ralphs, “Computational experience solving mixed integer interdiction problems,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Bibtex]

@TechReport{ DeNRal17,
title = {Computational Experience Solving Mixed Integer
Interdiction Problems},
author  = {DeNegre, S.T. and Ralphs, T.K.},
year = {2017},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

M. V. Galati and T. K. Ralphs, “DIP: a framework for decomposition in integer programming,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Software] [PDF] [Bibtex]

@TechReport{ GalRal17,
title = {{{DIP}}: A Framework for Decomposition in Integer
Programming},
author  = {Galati, M.V. and Ralphs, T.K.},
year = {2017},
institution  = {Working Paper, COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/talks/DecompCSIRO11.pdf},
software  = {https://github.com/coin-or/Dip}
}

M. Miltenberger, T. K. Ralphs, and D. Steffy, “Exploring the numerics of branch-and-cut for mixed integer linear optimization,” in Operations research proceedings: 2017, 2017. [PDF] [Bibtex]

@InProceedings{ MilRalSte17,
title = {Exploring the Numerics of Branch-and-Cut for Mixed Integer
Linear Optimization},
booktitle  = {Operations Research Proceedings: 2017},
author  = {Miltenberger, M. and Ralphs, T.K. and Steffy, D.},
year = {2017},
publisher  = {Springer Berlin / Heidelberg},
url = {https://opus4.kobv.de/opus4-zib/files/6464/numerics_in_mip.pdf}
}

M. E. Pfetsch and T. K. Ralphs, “Towards more “scientific” computations in mathematical optimization,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Bibtex]

@TechReport{ PfeRal17,
title = {Towards More "Scientific" Computations in Mathematical
Optimization},
author  = {Pfetsch, M.E. and Ralphs, T.K.},
year = {2017},
institution  = {Working Paper, COR@L Laboratory, Lehigh University}
}

2016

P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, “A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization,” Discrete optimization, vol. 24, 2016. [Software] [PDF] [DOI] [Bibtex]

@Article{ BelGoePolRalTer16,
title = {A Complete Characterization of Disjunctive Conic Cuts for
Mixed Integer Second Order Cone Optimization},
author  = {Belotti, P. and G{\'o}ez, J.C. and P{\'o}lik, I. and
Ralphs, T.K. and Terlaky, T.},
year = {2016},
journal  = {Discrete Optimization},
volume  = {24},
issn = {15725286},
doi = {10.1016/j.disopt.2016.10.001},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ConicCuts14.pdf},
abstract  = {{\copyright} 2016 Elsevier B.V. We study the convex hull
of the intersection of a disjunctive set defined by
parallel hyperplanes and the feasible set of a mixed
integer second order cone optimization (MISOCO) problem. We
extend our prior work on disjunctive conic cuts (DCCs),
which has thus far been restricted to the case in which the
intersection of the hyperplanes and the feasible set is
bounded. Using a similar technique, we show that one can
extend our previous results to the case in which that
intersection is unbounded. We provide a complete
characterization in closed form of the conic inequalities
required to describe the convex hull when the hyperplanes
defining the disjunction are parallel.},
keywords  = {Disjunctive conic cuts,Disjunctive programming,Mixed
integer optimization,Second order cone optimization},
software  = {https://github.com/aykutbulut/CGL-CONIC}
}

Y. Zhang, L. V. Snyder, T. K. Ralphs, and Z. Xue, “The competitive facility location problem under disruption risks,” Transportation research part e: logistics and transportation review, vol. 93, 2016. [PDF] [DOI] [Bibtex]

@Article{ ZhaSnyRalXue16,
title = {The Competitive Facility Location Problem under Disruption
Risks},
author  = {Zhang, Y. and Snyder, L.V. and Ralphs, T.K. and Xue, Z.},
year = {2016},
journal  = {Transportation Research Part E: Logistics and
Transportation Review},
volume  = {93},
issn = {13665545},
doi = {10.1016/j.tre.2016.07.002},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CFLPD16.pdf},
abstract  = {{\copyright} 2016 Elsevier Ltd Two players sequentially
locate a fixed number of facilities, competing to capture
market share. Facilities face disruption risks, and each
customer patronizes the nearest operational facility,
regardless of who operates it. The problem therefore
combines competitive location and location with
disruptions. This combination has been absent from the
literature. We model the problem as a Stackelberg game in
which the leader locates facilities first, followed by the
follower, and formulate the leader's decision problem as a
bilevel optimization problem. A variable neighborhood
decomposition search heuristic which includes variable
fixing and cut generation is developed. Computational
results suggest that high quality solutions can be found
quickly. Interesting managerial insights are drawn.},
keywords  = {Bilevel optimization,Competitive location,Facility
disruptions,Local search,Variable neighborhood search}
}

2015

P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, “A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization,” in Numerical analysis and optimization, 2015. [PDF] [DOI] [Bibtex]

@InProceedings{ BelGoePolRalTer15,
title = {A Conic Representation of the Convex Hull of Disjunctive
Sets and Conic Cuts for Integer Second Order Cone
Optimization},
booktitle  = {Numerical Analysis and Optimization},
author  = {Belotti, P. and G{\'o}ez, J.C. and P{\'o}lik, I. and
Ralphs, T.K. and Terlaky, T.},
year = {2015},
volume  = {134},
issn = {21941017},
doi = {10.1007/978-3-319-17689-5_1},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ConicCuts12.pdf},
abstract  = {{\copyright} Springer International Publishing Switzerland
2015. We study the convex hull of the intersection of a
convex set E and a disjunctive set. This intersection is at
the core of solution techniques for Mixed Integer Convex
Optimization.We prove that if there exists a cone K (resp.,
a cylinder C) that has the same intersection with the
boundary of the disjunction as E, then the convex hull is
the intersection of E with K (resp., C). The existence of
such a cone (resp., a cylinder) is difficult to prove for
general conic optimization. We prove existence and unicity
of a second order cone (resp., a cylinder), when E is the
intersection of an affine space and a second order cone
(resp., a cylinder). We also provide a method for finding
that cone, and hence the convex hull, for the continuous
relaxation of the feasible set of a Mixed Integer Second
Order Cone Optimization (MISOCO) problem, assumed to be the
intersection of an ellipsoid with a general linear
disjunction. This cone provides a new conic cut for MISOCO
that can be used in branch-and-cut algorithms for MISOCO
problems.},
isbn = {978-3-319-17688-8},
keywords  = {Conic cuts,Mixed integer optimization,Second order cone
Optimization}
}

T. K. Ralphs, “Data science and analytics,” {Industrial and Systems Engineering Report 15T-009, Lehigh University} 2015. [PDF] [Bibtex]

@TechReport{ Ral15,
title = {Data Science and Analytics},
author  = {Ralphs, T.K.},
year = {2015},
institution  = {{Industrial and Systems Engineering Report 15T-009, Lehigh
University}},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/dataScience.pdf}
}

2014

A. Hassanzadeh and T. K. Ralphs, “On the value function of a mixed integer linear optimization problem and an algorithm for its construction,” COR@L Laboratory, Lehigh University, 14T-004, 2014. [Software] [PDF] [Bibtex]

@TechReport{ HasRal14,
title = {On the Value Function of a Mixed Integer Linear
Optimization Problem and an Algorithm for Its
Construction},
author  = {Hassanzadeh, A. and Ralphs, T.K.},
year = {2014},
number  = {14T-004},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILPValueFunction14.pdf},
software  = {https://github.com/tkralphs/ValueFunction}
}

A. Hassanzadeh and T. K. Ralphs, “A generalization of benders’ algorithm for two-stage stochastic optimization problems with mixed integer recourse,” COR@L Laboratory, Lehigh University, 14T-005, 2014. [Software] [PDF] [Bibtex]

@TechReport{ HasRal14a,
title = {A Generalization of Benders' Algorithm for Two-Stage
Stochastic Optimization Problems with Mixed Integer
Recourse},
author  = {Hassanzadeh, A. and Ralphs, T.K.},
year = {2014},
number  = {14T-005},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/SMILPGenBenders14.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

A. Lodi, T. K. Ralphs, and G. Woeginger, “Bilevel programming and the separation problem,” Mathematical programming, vol. 148, p. 437–458, 2014. [PDF] [DOI] [Bibtex]

@Article{ LodRalWoe14,
title = {Bilevel Programming and the Separation Problem},
author  = {Lodi, A. and Ralphs, T.K. and Woeginger, G.},
year = {2014},
journal  = {Mathematical Programming},
volume  = {148},
pages = {437--458},
doi = {10.1007/s10107-013-0700-x},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BilevelSeparation12.pdf}
}

2013

P. Belotti, J. C. Goez, I. Polik, T. K. Ralphs, and T. Terlaky, “On families of quadratic surfaces having fixed intersection with two hyperplanes,” Discrete applied mathematics, vol. 161, p. 2778–2793, 2013. [PDF] [DOI] [Bibtex]

@Article{ BelGoePolRalTer13,
title = {On Families of Quadratic Surfaces Having Fixed
Intersection with Two Hyperplanes},
author  = {Belotti, P. and Goez, J.C. and Polik, I. and Ralphs, T.K.
and Terlaky, T.},
year = {2013},
journal  = {Discrete Applied Mathematics},
volume  = {161},
pages = {2778--2793},
doi = {10.1016/j.dam.2013.05.017},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/Quadratic11.pdf}
}

K. L. Hoffman and T. K. Ralphs, “Integer and combinatorial optimization,” in Encyclopedia of Operations Research and Management Science, Springer, 2013, p. 771–783. [PDF] [DOI] [Bibtex]

@InCollection{ HofRal13,
title = {Integer and Combinatorial Optimization},
booktitle  = {Encyclopedia of {{Operations Research}} and {{Management
Science}}},
author  = {Hoffman, K.L. and Ralphs, T.K.},
year = {2013},
pages = {771--783},
publisher  = {Springer},
doi = {10.1007/978-1-4419-1153-7_129},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ICO-EORMS11.pdf}
}

T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY version 5.5 user’s manual,” COR@L Laboratory, Lehigh University 2013. [Software] [PDF] [Bibtex]

@TechReport{ RalGuzMah13,
title = {{{SYMPHONY}} Version 5.5 User's Manual},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
year = {2013},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.5.0-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

J. Wang and T. K. Ralphs, “Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization,” in Proceedings of the conference on constraint programming, artificial intelligence, and operations research, 2013, p. 394–402. [Software] [PDF] [DOI] [Bibtex]

@InProceedings{ WanRal13,
title = {Computational Experience with Hypergraph-Based Methods for
Automatic Decomposition in Discrete Optimization},
booktitle  = {Proceedings of the Conference on Constraint Programming,
Artificial Intelligence, and Operations Research},
author  = {Wang, J. and Ralphs, T.K.},
year = {2013},
pages = {394--402},
issn = {03029743},
doi = {10.1007/978-3-642-38171-3_31},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CPAIOR12.pdf},
abstract  = {Branch-and-price (BAP) algorithms based on Dantzig-Wolfe
decomposition have shown great success in solving mixed
integer linear optimization problems (MILPs) with specific
identifiable structure. Only recently has there been
investigation into the development of a "generic" version
of BAP for unstructured MILPs. One of the most important
elements required for such a generic BAP algorithm is an
automatic method of decomposition. In this paper, we report
on preliminary experiments using hypergraph partitioning as
a means of performing such automatic decomposition.
{\copyright} Springer-Verlag 2013.},
isbn = {978-3-642-38170-6},
software  = {https://github.com/coin-or/Dip}
}

2012

M. V. Galati, T. K. Ralphs, and J. Wang, “Computational experience with generic decomposition using the DIP framework,” in Proceedings of RAMP 2012, 2012. [Software] [PDF] [Bibtex]

@InProceedings{ GalRalWan12,
title = {Computational Experience with Generic Decomposition Using
the {{DIP}} Framework},
booktitle  = {Proceedings of {{RAMP}} 2012},
author  = {Galati, M.V. and Ralphs, T.K. and Wang, J.},
year = {2012},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/RAMP12.pdf},
software  = {https://github.com/coin-or/Dip}
}

T. Koch, T. K. Ralphs, and Y. Shinano, “Could we use a million cores to solve an integer program?,” Mathematical methods of operations research, vol. 76, p. 67–93, 2012. [PDF] [DOI] [Bibtex]

@Article{ KocRalShi12,
title = {Could We Use a Million Cores to Solve an Integer
Program?},
author  = {Koch, T. and Ralphs, T.K. and Shinano, Y.},
year = {2012},
journal  = {Mathematical Methods of Operations Research},
volume  = {76},
pages = {67--93},
doi = {10.1007/s00186-012-0390-9},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/Million11.pdf}
}

2011

M. Güzelsoy and T. K. Ralphs, “Warm-starting for real-time vehicle routing,” COR@L Laboratory, Lehigh University 2011. [Software] [Bibtex]

@TechReport{ GuzRal11,
title = {Warm-Starting for Real-Time Vehicle Routing},
author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
year = {2011},
institution  = {COR@L Laboratory, Lehigh University},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. Koch, T. Achterburg, E. Andersen, O. Bastert, T. Berthold, R. E. Bixby, E. Danna, G. Gamrath, A. Gleixner, S. Heinz, A. Lodi, H. Mittelmann, T. K. Ralphs, D. Salvagnin, D. Steffy, and K. Wolter, “Miplib 2010,” Mathematical programming computation, vol. 3, p. 103–163, 2011. [Software] [PDF] [DOI] [Bibtex]

@Article{ KocAchAndBasBerBixDanGamGleHei.ea11,
title = {Miplib 2010},
author  = {Koch, T. and Achterburg, T. and Andersen, E. and Bastert,
O. and Berthold, T. and Bixby, R.E. and Danna, E. and
Gamrath, G. and Gleixner, A. and Heinz, S. and Lodi, A. and
Mittelmann, H. and Ralphs, T.K. and Salvagnin, D. and
Steffy, D. and Wolter, K.},
year = {2011},
journal  = {Mathematical Programming Computation},
volume  = {3},
pages = {103--163},
doi = {10.1007/s12532-011-0025-9},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/miplib5.pdf},
software  = {http://miplib.zib.de/download/scriptversions/}
}

A. Lodi, T. K. Ralphs, F. Rossi, and S. Smriglio, “Interdiction branching,” COR@L Laboratory, Lehigh University, 11T-012-R2, 2011. [Software] [PDF] [Bibtex]

@TechReport{ LodRalRosSmr11,
title = {Interdiction Branching},
author  = {Lodi, A. and Ralphs, T.K. and Rossi, F. and Smriglio, S.},
year = {2011},
number  = {11T-012-R2},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BilevelBranching.pdf},
software  = {https://github.com/tkralphs/InterdictionBranch}
}

T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY version 5.3 user’s manual,” COR@L Laboratory, Lehigh University 2011. [Software] [PDF] [Bibtex]

@TechReport{ RalGuzMah11,
title = {{{SYMPHONY}} Version 5.3 User's Manual},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
year = {2011},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.3.4-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY version 5.4 user’s manual,” COR@L Laboratory, Lehigh University 2011. [Software] [PDF] [Bibtex]

@TechReport{ RalGuzMah11a,
title = {{{SYMPHONY}} Version 5.4 User's Manual},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
year = {2011},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.4.0-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

2010

Z. Akca, R. T. Berger, and T. K. Ralphs, “Solution methods for the multi-trip elementary shortest path problem with resource constraints,” COR@L Laboratory, Lehigh University 2010. [PDF] [Bibtex]

@TechReport{ AkcBerRal10,
title = {Solution Methods for the Multi-Trip Elementary Shortest
Path Problem with Resource Constraints},
author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
year = {2010},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MESPPRC10.pdf}
}

M. Güzelsoy and T. K. Ralphs, “Integer programming duality,” in Encyclopedia of Operations Research and Management Science, J. Cochran, Ed., Wiley, 2010. [PDF] [DOI] [Bibtex]

@InCollection{ GuzRal10,
title = {Integer Programming Duality},
booktitle  = {Encyclopedia of {{Operations Research}} and {{Management
Science}}},
author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
editor  = {Cochran, J.},
year = {2010},
publisher  = {Wiley},
doi = {10.1002/9780470400531},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/Duality-EOR10.pdf}
}

A. Mahajan and T. K. Ralphs, “On the complexity of selecting disjunctions in integer programming,” Siam journal on optimization, vol. 20, iss. 5, p. 2181–2198, 2010. [PDF] [DOI] [Bibtex]

@Article{ MahRal10,
title = {On the Complexity of Selecting Disjunctions in Integer
Programming},
author  = {Mahajan, A. and Ralphs, T.K.},
year = {2010},
journal  = {SIAM Journal on Optimization},
volume  = {20},
number  = {5},
pages = {2181--2198},
doi = {10.1137/080737587},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/Branching08.pdf}
}

T. K. Ralphs and M. V. Galati, “Decomposition methods,” in Encyclopedia of Operations Research and Management Science, J. Cochran, Ed., Wiley, 2010. [PDF] [DOI] [Bibtex]

@InCollection{ RalGal10,
title = {Decomposition Methods},
booktitle  = {Encyclopedia of {{Operations Research}} and {{Management
Science}}},
author  = {Ralphs, T.K. and Galati, M.V.},
editor  = {Cochran, J.},
year = {2010},
publisher  = {Wiley},
doi = {10.1002/9780470400531},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/Decomp-EOR10.pdf}
}

T. K. Ralphs, A. Mahajan, and M. Güzelsoy, “SYMPHONY version 5.2 user’s manual,” COR@L Laboratory, Lehigh University 2010. [Software] [PDF] [Bibtex]

@TechReport{ RalMahGuz10,
title = {{{SYMPHONY}} Version 5.2 User's Manual},
author  = {Ralphs, T.K. and Mahajan, A. and G{\"u}zelsoy, M.},
year = {2010},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.2.3-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

2009

Z. Akca, R. T. Berger, and T. K. Ralphs, “A branch-and-price algorithm for combined location and routing problems under capacity restrictions,” in Proceedings of the eleventh INFORMS computing society meeting, 2009, p. 309–330. [PDF] [DOI] [Bibtex]

@InProceedings{ AkcBerRal09,
title = {A Branch-and-Price Algorithm for Combined Location and
Routing Problems under Capacity Restrictions},
booktitle  = {Proceedings of the Eleventh {{INFORMS}} Computing Society
Meeting},
author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
year = {2009},
pages = {309--330},
doi = {10.1007/978-0-387-88843-9_16},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/LRP08.pdf}
}

S. DeNegre and T. K. Ralphs, “A branch-and-cut algorithm for bilevel integer programming,” in Proceedings of the eleventh INFORMS computing society meeting, 2009, p. 65–78. [Software] [PDF] [DOI] [Bibtex]

@InProceedings{ DeNRal09,
title = {A Branch-and-Cut Algorithm for Bilevel Integer
Programming},
booktitle  = {Proceedings of the Eleventh {{INFORMS}} Computing Society
Meeting},
author  = {DeNegre, S. and Ralphs, T.K.},
year = {2009},
pages = {65--78},
doi = {10.1007/978-0-387-88843-9_4},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BILEVEL08.pdf},
software  = {https://github.com/coin-or/MibS}
}

A. Lodi and T. K. Ralphs, “Bilevel programming and maximally violated valid inequalities,” in Proceedings of the cologne twente workshop on graphs and combinatorial optimization, 2009, p. 125–134. [PDF] [Bibtex]

@InProceedings{ LodRal09,
title = {Bilevel Programming and Maximally Violated Valid
Inequalities},
booktitle  = {Proceedings of the Cologne Twente Workshop on Graphs and
Combinatorial Optimization},
author  = {Lodi, A. and Ralphs, T.K.},
year = {2009},
pages = {125--134},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CTW09.pdf}
}

A. Mahajan and T. K. Ralphs, “Experiments with branching using general disjunctions,” in Proceedings of the eleventh INFORMS computing society meeting, 2009, p. 101–118. [PDF] [DOI] [Bibtex]

@InProceedings{ MahRal09,
title = {Experiments with Branching Using General Disjunctions},
booktitle  = {Proceedings of the Eleventh {{INFORMS}} Computing Society
Meeting},
author  = {Mahajan, A. and Ralphs, T.K.},
year = {2009},
pages = {101--118},
doi = {10.1007/978-0-387-88843-9_6},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CompBranching08.pdf}
}

Y. Xu, T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “Computational experience with a software framework for parallel integer programming,” The informs journal on computing, vol. 21, p. 383–397, 2009. [Software] [PDF] [DOI] [Bibtex]

@Article{ XuRalLadSal09,
title = {Computational Experience with a Software Framework for
Parallel Integer Programming},
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
year = {2009},
journal  = {The INFORMS Journal on Computing},
volume  = {21},
pages = {383--397},
doi = {10.1287/ijoc.1090.0347},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CHiPPS-Rev.pdf},
software  = {https://github.com/coin-or/CHiPPS-ALPS}
}

2008

Z. Akca, R. T. Berger, and T. K. Ralphs, “Modeling and solving location, routing, and scheduling problems,” COR@L Laboratory, Lehigh University, 08T-009, 2008. [PDF] [Bibtex]

@TechReport{ AkcBerRal08,
title = {Modeling and Solving Location, Routing, and Scheduling
Problems},
author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
year = {2008},
number  = {08T-009},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/LRSP08.pdf}
}

M. Güzelsoy and T. K. Ralphs, “The value function of a mixed-integer linear program with a single constraint,” COR@L Laboratory, Lehigh University 2008. [PDF] [Bibtex]

@TechReport{ GuzRal08,
title = {The Value Function of a Mixed-Integer Linear Program with
a Single Constraint},
author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
year = {2008},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ValueFunction.pdf}
}

T. K. Ralphs, “SYMPHONY version 5.1 user’s manual,” COR@L Laboratory, Lehigh University 2008. [Software] [PDF] [Bibtex]

@TechReport{ Ral08,
title = {{{SYMPHONY}} Version 5.1 User's Manual},
author  = {Ralphs, T.K.},
year = {2008},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://www.coin-or.org/SYMPHONY/SYMPHONY-5.1.8-Manual.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

2007

M. Güzelsoy and T. K. Ralphs, “Duality for mixed-integer linear programs,” International journal of operations research, vol. 4, p. 118–137, 2007. [PDF] [Bibtex]

@Article{ GuzRal07,
title = {Duality for Mixed-Integer Linear Programs},
author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
year = {2007},
journal  = {International Journal of Operations Research},
volume  = {4},
pages = {118--137},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILPD06.pdf}
}

O. Osaltyn, B. Hunsaker, and T. K. Ralphs, “Visualizing branch-and-bound algorithms,” COR@L Laboratory, Lehigh Univesity 2007. [Software] [PDF] [Bibtex]

@TechReport{ OsaHunRal07,
title = {Visualizing Branch-and-Bound Algorithms},
author  = {Osaltyn, O. and Hunsaker, B. and Ralphs, T.K.},
year = {2007},
institution  = {COR@L Laboratory, Lehigh Univesity},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BBVis.pdf},
software  = {http://github.com/coin-or/GrUMPy}
}

Y. Xu, T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “Computational experience with a framework for parallel integer programming,” COR@L Laboratory, Lehigh University 2007. [Software] [PDF] [Bibtex]

@TechReport{ XuRalLadSal07,
title = {Computational Experience with a Framework for Parallel
Integer Programming},
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
year = {2007},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CHiPPS.pdf},
software  = {https://github.com/coin-or/CHiPPS-BLIS}
}

2006

T. K. Ralphs, “Parallel branch and cut,” in Parallel Combinatorial Optimization, E. Talbi, Ed., Wiley, 2006, p. 53–101. [Software] [PDF] [Bibtex]

@InCollection{ Ral06,
title = {Parallel Branch and Cut},
booktitle  = {Parallel {{Combinatorial Optimization}}},
author  = {Ralphs, T.K.},
editor  = {Talbi, E.},
year = {2006},
pages = {53--101},
publisher  = {Wiley},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/PBandC.pdf},
city = {New York},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs and M. V. Galati, “Decomposition and dynamic cut generation in integer programming,” Mathematical programming, vol. 106, p. 261–285, 2006. [Software] [PDF] [DOI] [Bibtex]

@Article{ RalGal06,
title = {Decomposition and Dynamic Cut Generation in Integer
Programming},
author  = {Ralphs, T.K. and Galati, M.V.},
year = {2006},
journal  = {Mathematical Programming},
volume  = {106},
pages = {261--285},
doi = {10.1007/s10107-005-0606-3},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/DECOMP.pdf},
software  = {https://github.com/coin-or/Dip}
}

T. K. Ralphs and M. Güzelsoy, “Duality and warm starting in integer programming,” in The proceedings of the 2006 NSF design, service, and manufacturing grantees and research conference, 2006. [Software] [PDF] [Bibtex]

@InProceedings{ RalGuz06,
title = {Duality and Warm Starting in Integer Programming},
booktitle  = {The Proceedings of the 2006 {{NSF}} Design, Service, and
Manufacturing Grantees and Research Conference},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
year = {2006},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/DMII06.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, M. J. Saltzman, and M. M. Wiecek, “An improved algorithm for biobjective integer programming,” Annals of operations research, vol. 147, p. 43–70, 2006. [Software] [PDF] [DOI] [Bibtex]

@Article{ RalSalWie06,
title = {An Improved Algorithm for Biobjective Integer
Programming},
author  = {Ralphs, T.K. and Saltzman, M.J. and Wiecek, M.M.},
year = {2006},
journal  = {Annals of Operations Research},
volume  = {147},
pages = {43--70},
doi = {10.1007/s10479-006-0058-z},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BICRIT2.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

2005

J. T. Linderoth and T. K. Ralphs, “Noncommercial software for mixed-integer linear programming,” in Integer Programming: Theory and Practice, J. Karlof, Ed., Crc press, 2005, p. 253–303. [PDF] [Bibtex]

@InCollection{ LinRal05,
title = {Noncommercial Software for Mixed-Integer Linear
Programming},
booktitle  = {Integer {{Programming}}: {{Theory}} and {{Practice}}},
author  = {Linderoth, J.T. and Ralphs, T.K.},
editor  = {Karlof, J},
year = {2005},
pages = {253--303},
publisher  = {CRC Press},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILP04.pdf}
}

T. K. Ralphs and M. V. Galati, “Decomposition in integer programming,” in Integer Programming: Theory and Practice, J. Karlof, Ed., Crc press, 2005, p. 57–110. [Software] [PDF] [Bibtex]

@InCollection{ RalGal05,
title = {Decomposition in Integer Programming},
booktitle  = {Integer {{Programming}}: {{Theory}} and {{Practice}}},
author  = {Ralphs, T.K. and Galati, M.V.},
editor  = {Karlof, J},
year = {2005},
pages = {57--110},
publisher  = {CRC Press},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/DECOMP04.pdf},
software  = {https://github.com/coin-or/Dip}
}

T. K. Ralphs and M. Güzelsoy, “The SYMPHONY callable library for mixed integer programming,” in Proceedings of the ninth INFORMS computing society conference, 2005, p. 61–76. [Software] [PDF] [DOI] [Bibtex]

@InProceedings{ RalGuz05,
title = {The {{SYMPHONY}} Callable Library for Mixed Integer
Programming},
booktitle  = {Proceedings of the Ninth {{INFORMS}} Computing Society
Conference},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
year = {2005},
pages = {61--76},
issn = {1387666X},
doi = {10.1007/0-387-23529-9_5},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/SYMPHONY04.pdf},
abstract  = {SYMPHONY is a customizable, open-source library for
solving mixed-integer linear programs (MILP) by branch,
cut, and price. With its large assortment of parameter
settings, user callback functions, and compile-time
options, SYMPHONY can be configured as a generic MILP
solver or an engine for solving difficult MILPs by means of
a fully customized algorithm. SYMPHONY can run on a variety
of architectures, including single-processor,
distributed-memory parallel, and shared-memory parallel
architectures under MS Windows, Linux, and other Unix
operating systems. The latest version is implemented as a
callable library that can be accessed either through calls
to the native C application program interface, or through a
C++ interface class derived from the COIN-OR Open Solver
Interface. Among its new features are the ability to solve
bicriteria MILPs, the ability to stop and warm start MILP
computations after modifying parameters or problem data,
the ability to create persistent cut pools, and the ability
to perform rudimentary sensitivity analysis on MILPs.
{\copyright} 2005 Springer Science+Business Media, Inc.},
keywords  = {Branch and bound,Branch and cut,Integer
programming,Sensitivity analysis,Software},
software  = {https://github.com/coin-or/SYMPHONY}
}

Y. Xu, T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “ALPS: a framework for implementing parallel tree search algorithms,” in The proceedings of the ninth INFORMS computing society conference, 2005, p. 319–334. [Software] [PDF] [DOI] [Bibtex]

@InProceedings{ XuRalLadSal05,
title = {{{ALPS}}: A Framework for Implementing Parallel Tree
Search Algorithms},
booktitle  = {The Proceedings of the Ninth {{INFORMS}} Computing Society
Conference},
author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
M.J.},
year = {2005},
volume  = {29},
pages = {319--334},
issn = {1387666X},
doi = {10.1007/0-387-23529-9_21},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ALPS04.pdf},
abstract  = {ALPS is a framework for implementing and parallelizing
tree search algorithms. It employs a number of features to
improve scalability and is designed specifically to support
the implementation of data intensive algorithms, in which
large amounts of knowledge are generated and must be
maintained and shared during the search. Implementing such
algorithms in a scalable manner is challenging both because
of storage requirements and because of communications
overhead incurred in the sharing of data. In this abstract,
we describe the design of ALPS and how the design addresses
these challenges. We present two sample applications built
with ALPS and preliminary computational results.
{\copyright} 2005 Springer Science+Business Media, Inc.},
keywords  = {Branch and bound,Integer programming,Parallel
algorithm,Software},
software  = {https://github.com/coin-or/CHiPPS-ALPS}
}

2004

T. K. Ralphs and M. Güzelsoy, “Duality, warm starting, and sensitivity analysis in integer programming,” COR@L Laboratory, Lehigh University, 04T-022, 2004. [PDF] [Bibtex]

@TechReport{ RalGuz04,
title = {Duality, Warm Starting, and Sensitivity Analysis in
Integer Programming},
author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
year = {2004},
number  = {04T-022},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://ise.lehigh.edu/sites/ise.lehigh.edu/files/04t_022.pdf},
note = {Available by request}
}

T. K. Ralphs, “SYMPHONY version 5.0 user’s manual,” COR@L Laboratory, Lehigh University, 04T-011, 2004. [Software] [Bibtex]

@TechReport{ Ral04,
title = {{{SYMPHONY}} Version 5.0 User's Manual},
author  = {Ralphs, T.K.},
year = {2004},
number  = {04T-011},
institution  = {COR@L Laboratory, Lehigh University},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “A library hierarchy for implementing scalable parallel search algorithms,” Journal of supercomputing, vol. 28, p. 215–234, 2004. [Software] [PDF] [DOI] [Bibtex]

@Article{ RalLadSal04,
title = {A Library Hierarchy for Implementing Scalable Parallel
Search Algorithms},
author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
year = {2004},
journal  = {Journal of Supercomputing},
volume  = {28},
pages = {215--234},
doi = {10.1023/B:SUPE.0000020179.55383.ad},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/JSC02.pdf},
software  = {https://github.com/coin-or/CHiPPS-ALPS}
}

T. K. Ralphs, M. J. Saltzman, and M. M. Wiecek, “An improved algorithm for biobjective integer programming and its application to network routing problems,” COR@L Laboratory Report, Lehigh University, 04T-004, 2004. [Software] [PDF] [Bibtex]

@TechReport{ RalSalWie04,
title = {An Improved Algorithm for Biobjective Integer Programming
and Its Application to Network Routing Problems},
author  = {Ralphs, T.K. and Saltzman, M.J. and Wiecek, M.M.},
year = {2004},
number  = {04T-004},
institution  = {COR@L Laboratory Report, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BICRIT.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

R. {Lougee-Heimer}, M. J. Saltzman, and T. K. Ralphs, COIN of the or realm, 2004. [PDF] [Bibtex]

@Misc{ LouSalRal04,
title = {{{COIN}} of the or Realm},
author  = {{Lougee-Heimer}, R. and Saltzman, M.J. and Ralphs, T.K.},
year = {2004},
month = oct,
journal  = {OR/MS Today},
url = {http://www.lionhrtpub.com/orms/orms-10-04/frcoin.html}
}

2003

T. K. Ralphs, “Parallel branch and cut for capacitated vehicle routing,” Parallel computing, vol. 29, p. 607–629, 2003. [Software] [PDF] [DOI] [Bibtex]

@Article{ Ral03,
title = {Parallel Branch and Cut for Capacitated Vehicle Routing},
author  = {Ralphs, T.K.},
year = {2003},
journal  = {Parallel Computing},
volume  = {29},
pages = {607--629},
doi = {10.1016/S0167-8191(03)00045-0},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/PVRP.pdf},
annotation  = {Software: https://github.com/coin-or/SYMPHONY},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, “SYMPHONY version 4.0 user’s manual,” COR@L Laboratory, Lehigh University 2003. [Software] [Bibtex]

@TechReport{ Ral03a,
title = {{{SYMPHONY}} Version 4.0 User's Manual},
author  = {Ralphs, T.K.},
year = {2003},
institution  = {COR@L Laboratory, Lehigh University},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and T. L. E. Jr., “On the capacitated vehicle routing problem,” Mathematical programming, vol. 94, p. 343–359, 2003. [Software] [PDF] [DOI] [Bibtex]

@Article{ RalKopPulJr03,
title = {On the Capacitated Vehicle Routing Problem},
author  = {Ralphs, T.K. and Kopman, L. and Pulleyblank, W.R. and Jr.,
L.E. Trotter},
year = {2003},
journal  = {Mathematical Programming},
volume  = {94},
pages = {343--359},
doi = {10.1007/s10107-002-0323-0},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/VRP.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “Parallel branch, cut, and price for large-scale discrete optimization,” Mathematical programming, vol. 98, p. 253–280, 2003. [Software] [PDF] [DOI] [Bibtex]

@Article{ RalLadSal03,
title = {Parallel Branch, Cut, and Price for Large-Scale Discrete
Optimization},
author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
year = {2003},
journal  = {Mathematical Programming},
volume  = {98},
pages = {253--280},
doi = {10.1007/s10107-003-0404-8},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/PBCP.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

2002

L. Ladányi, T. K. Ralphs, and M. J. Saltzman, “Implementing scalable parallel search algorithms for data-intensive applications,” in Proceedings of the international conference on computational science, 2002, p. 592–602. [Software] [PDF] [DOI] [Bibtex]

@InProceedings{ LadRalSal02,
title = {Implementing Scalable Parallel Search Algorithms for
Data-Intensive Applications},
booktitle  = {Proceedings of the International Conference on
Computational Science},
author  = {Lad{\'a}nyi, L. and Ralphs, T.K. and Saltzman, M.J.},
year = {2002},
pages = {592--602},
issn = {03029743},
doi = {10.1007/3-540-46043-8_60},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ICCS02.pdf},
abstract  = {Scalability is a critical issue in the design of parallel
software for large-scale search problems. Previous research
has not addressed this issue for data-intensive
applications. We describe the design of a library for
parallel search that focuses on efficient data and search
tree management for such applications in distributed
computing environments. {\copyright} 2002 Springer-Verlag
Berlin Heidelberg.},
isbn = {3-540-43591-3},
software  = {https://github.com/coin-or/CHiPPS-ALPS}
}

2001

L. Ladányi, T. K. Ralphs, and T. L. E. Jr., “Branch, cut, and price: Sequential and parallel,” in Computational Combinatorial Optimization, D. Naddef and M. Juenger, Eds., Springer, 2001, p. 223–260. [PDF] [DOI] [Bibtex]

@InCollection{ LadRalJr01,
title = {Branch, Cut, and Price: {{Sequential}} and Parallel},
booktitle  = {Computational {{Combinatorial Optimization}}},
author  = {Lad{\'a}nyi, L. and Ralphs, T.K. and Jr., L.E. Trotter},
editor  = {Naddef, D and Juenger, M},
year = {2001},
pages = {223--260},
publisher  = {Springer},
doi = {10.1007/3-540-45586-8_6},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/LNCS.pdf},
city = {Berlin}
}

T. K. Ralphs and J. C. Hartman, “Capacitated network routing (a preliminary progress report),” COR@L Laboratory, Lehigh University, 01W-009, 2001. [Software] [PDF] [Bibtex]

@TechReport{ RalHar01,
title = {Capacitated Network Routing (a Preliminary Progress
Report)},
author  = {Ralphs, T.K. and Hartman, J.C.},
year = {2001},
number  = {01W-009},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/CNRP.pdf},
software  = {https://github.com/coin-or/SYMPHONY}
}

T. K. Ralphs and L. Ladányi, “COIN/BCP user’s manual,” COR@L Laboratory, Lehigh University 2001. [Software] [PDF] [Bibtex]

@TechReport{ RalLad01,
title = {{{COIN}}/{{BCP}} User's Manual},
author  = {Ralphs, T.K. and Lad{\'a}nyi, L.},
year = {2001},
institution  = {COR@L Laboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/BCP-Manual.pdf},
software  = {https://github.com/coin-or/Bcp}
}

T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “A library hierarchy for implementing scalable parallel search algorithms,” COR@LLaboratory, Lehigh University 2001. [Software] [PDF] [Bibtex]

@TechReport{ RalLadSal01,
title = {A Library Hierarchy for Implementing Scalable Parallel
Search Algorithms},
author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
year = {2001},
institution  = {COR@LLaboratory, Lehigh University},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/ALPS.pdf},
software  = {https://github.com/coin-or/CHiPPS-ALPS}
}

R. {Lougee-Heimer}, M. J. Saltzman, and T. K. Ralphs, The COIN-or initiative: Open-source software accelerates operations research progress, 2001. [PDF] [Bibtex]

@Misc{ LouSalRal01,
title = {The {{COIN-or}} Initiative: {{Open-source}} Software
Accelerates Operations Research Progress},
author  = {{Lougee-Heimer}, R. and Saltzman, M.J. and Ralphs, T.K.},
year = {2001},
journal  = {OR/MS Today},
url = {http://lionhrtpub.com/orms/orms-10-01/forumfr.html}
}

2000

T. K. Ralphs and L. Ladányi, “SYMPHONY: a parallel framework for branch, cut, and price,” Rice University 2000. [Software] [Bibtex]

@TechReport{ RalLad00,
title = {{{SYMPHONY}}: A Parallel Framework for Branch, Cut, and
Price},
author  = {Ralphs, T.K. and Lad{\'a}nyi, L.},
year = {2000},
institution  = {Rice University},
software  = {https://github.com/coin-or/SYMPHONY}
}

1997

M. Esö, L. Ladányi, T. K. Ralphs, and T. L. E. Jr., “Fully parallel generic branch-and-cut framework,” in Proceedings of the eighth \\vphantom\SIAM\vphantom\\ conference on parallel processing for scientific computing, 1997. [Software] [Bibtex]

@InProceedings{ EsoLadRalJr97,
title = {Fully Parallel Generic Branch-and-Cut Framework},
booktitle  = {Proceedings of the Eighth
\{\vphantom\}{{SIAM}}\vphantom\{\} Conference on Parallel
Processing for Scientific Computing},
author  = {Es{\"o}, M. and Lad{\'a}nyi, L. and Ralphs, T.K. and Jr.,
L.E. Trotter},
year = {1997},
software  = {https://github.com/coin-or/SYMPHONY}
}

1995

T. K. Ralphs, “Parallel branch and cut for vehicle routing,” PhD Thesis, 1995. [Software] [Bibtex]

@PhDThesis{ Ral95,
title = {Parallel Branch and Cut for Vehicle Routing},
author  = {Ralphs, T.K.},
year = {1995},
month = may,
school  = {Cornell University},
software  = {https://github.com/coin-or/SYMPHONY}
}

1993

T. K. Ralphs, “On the mixed chinese postman problem,” Operations research letters, vol. 14, p. 123–127, 1993. [PDF] [DOI] [Bibtex]

@Article{ Ral93,
title = {On the Mixed Chinese Postman Problem},
author  = {Ralphs, T.K.},
year = {1993},
journal  = {Operations Research Letters},
volume  = {14},
pages = {123--127},
doi = {10.1016/0167-6377(93)90021-8},
url = {http://coral.ie.lehigh.edu/~ted/files/papers/MPP.pdf}
}

If you find something here useful, buy me a beer!

Trackback