Technical Reports

2019

  • [Download PDF] F. E. Curtis and D. P. Robinson, “Exploiting Negative Curvature in Deterministic and Stochastic Optimization,” Mathematical Programming, Series B, vol. 176, iss. 1, p. 69–94, 2019. [Bibtex]
    @article{CurtRobi19,
    author = {Curtis, F. E. and Robinson, D. P.},
    title = {{Exploiting Negative Curvature in Deterministic and Stochastic Optimization}},
    journal = {{Mathematical Programming, Series B}},
    volume = {176},
    number = {1},
    pages = {69--94},
    year = {2019},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRobi19.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] J. V. Burke, F. E. Curtis, A. S. Lewis, M. L. Overton, and L. E. A. Simões, “Gradient Sampling Methods for Nonsmooth Optimization,” in Numerical Nonsmooth Optimization, Springer, 2019. [Bibtex]
    @incollection{BurkCurtLewiOverSimo19,
    author = {Burke, J. V. and Curtis, F. E. and Lewis, A. S. and Overton, M. L. and Sim\~oes, L. E. A.},
    title = {{Gradient Sampling Methods for Nonsmooth Optimization}},
    booktitle = {{Numerical Nonsmooth Optimization}},
    publisher = {Springer},
    chapter = {to appear},
    pages = {},
    year = {2019},
    url = {https://arxiv.org/abs/1804.11003},
    papercite = {2. Review Articles}
    }
  • [Download PDF] F. E. Curtis, K. Scheinberg, and R. Shi, “A Stochastic Trust Region Algorithm Based on Careful Step Normalization,” INFORMS Journal on Optimization, vol. https://doi.org/10.1287/ijoo.2018.0010, 2019. [Bibtex]
    @article{CurtScheShi19,
    author = {Curtis, F. E. and Scheinberg, K. and Shi, R.},
    title = {{A Stochastic Trust Region Algorithm Based on Careful Step Normalization}},
    journal = {{INFORMS Journal on Optimization}},
    volume = {https://doi.org/10.1287/ijoo.2018.0010},
    number = {},
    pages = {},
    year = {2019},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtScheShi17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, D. P. Robinson, and B. Zhou, “A Self-Correcting Variable-Metric Algorithm Framework for Nonsmooth Optimization,” IMA Journal of Numerical Analysis, vol. 10.1093/imanum/drz008, 2019. [Bibtex]
    @article{CurtRobiZhou19,
    author = {Curtis, F. E. and Robinson, D. P. and Zhou, B.},
    title = {{A Self-Correcting Variable-Metric Algorithm Framework for Nonsmooth Optimization}},
    journal = {{IMA Journal of Numerical Analysis}},
    volume = {10.1093/imanum/drz008},
    number = {},
    pages = {},
    year = {2019},
    url = {https://academic.oup.com/imajna/advance-article/doi/10.1093/imanum/drz008/5369122?guestAccessKey=a7e5eee5-9ed6-4a95-9f6c-f305237d0849},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] C. Ma, M. Jaggi, F. E. Curtis, N. Srebro, and M. Takáč, “An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning,” Optimization Methods and Software, vol. https://doi.org/10.1080/10556788.2019.1650361, 2019. [Bibtex]
    @article{MaJaggCurtSrebTaka19,
    author = {Ma, C. and Jaggi, M. and Curtis, F. E. and Srebro, N. and Tak\'a\v{c}, M.},
    title = {{An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning}},
    journal = {{Optimization Methods and Software}},
    volume = {https://doi.org/10.1080/10556788.2019.1650361},
    number = {},
    pages = {},
    year = {2019},
    url = {https://www.tandfonline.com/eprint/PXQPMMCNUWXHGPNCRPZE/full?target=10.1080/10556788.2019.1650361},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] A. Berahas, F. E. Curtis, and B. Zhou, Limited-Memory BFGS with Displacement Aggregation, 2019. [Bibtex]
    @unpublished{BeraCurtZhou19,
    author = {Berahas, A. and Curtis, F. E. and Zhou, B.},
    title = {{Limited-Memory BFGS with Displacement Aggregation}},
    note = {arXiv 1903.03471},
    year = {2019},
    url = {https://arxiv.org/abs/1903.03471},
    papercite = {3. Journal Articles}
    }
  • M. Yetkin, S. Kalidoss, F. E. Curtis, L. V. Snyder, and A. Banerjee, Practical optimal control of a wave-energy converter in regular wave environments, 2019. [Bibtex]
    @unpublished{YetkKaliCurtSnydBane19,
    author = {Yetkin, M. and Kalidoss, S. and Curtis, F. E. and Snyder, L. V. and Banerjee, A.},
    title = {{Practical optimal control of a wave-energy converter in regular wave environments}},
    note = {},
    year = {2019},
    url = {},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] 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,” Zuse Institute Berlin 2019. [Bibtex]
    @TechReport{ GleHenGamAchBasBerChrJarKocLin.ea19,
    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},
    institution  = {Zuse Institute Berlin},
    title = {{MIPLIB 2017: Data-Driven Compilation of the 6th
    Mixed-Integer Programming Library}},
    url = {http://www.optimization-online.org/DB{\_}FILE/2019/07/7285.pdf}
    ,
    year = {2019},
    }
  • [Download PDF] S. J. Maher, T. K. Ralphs, and Y. Shinano, “Assessing the Effectiveness of (Parallel) Branch-and-Bound Algorithms,” COR@L Technical Report 19T-017 2019. [Bibtex]
    @TechReport{ MahRalShi19,
    author  = {Maher, S.J. and Ralphs, T.K. and Shinano, Y.},
    institution  = {COR@L Technical Report 19T-017},
    title = {{Assessing the Effectiveness of (Parallel)
    Branch-and-Bound Algorithms}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ParallelAssessment19.pdf}
    ,
    year = {2019},
    }
  • 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 2019. [Bibtex]
    @TechReport{ ConRal19,
    author  = {Coniglio, S. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Bound-optimal Cuts: On the Generation of Cuts Which
    Maximize the Bound Improvement}},
    year = {2019},
    }
  • [Download PDF] S. Tahernejad and T. K. Ralphs, “Valid Inequalities for Mixed Integer Bilevel Optimization,” Working Paper, COR@L Laboratory, Lehigh University 2019. [Bibtex]
    @TechReport{ TahRal19,
    software  = {https://github.com/tkralphs/MibS},
    author  = {Tahernejad, S. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Valid Inequalities for Mixed Integer Bilevel
    Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/BilevelCuts-IWOBIP18.pdf}
    ,
    year = {2019},
    }
  • [Download PDF] S. Bolusani and T. K. Ralphs, “A Generalized Benders’ Algorithm for Mixed Integer Bilevel Linear Optimization,” Working Paper, COR@L Laboratory, Lehigh University 2019. [Bibtex]
    @TechReport{ BolRal19,
    author  = {Bolusani, S. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{A Generalized Benders' Algorithm for Mixed Integer
    Bilevel Linear Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/BilevelBenders-MOPTA18.pdf}
    ,
    year = {2019},
    }
  • [Download PDF] T. K. Ralphs, “Separation, Inverse Optimization, and Decomposition,” Working Paper, COR@L Laboratory, Lehigh University 2019. [Bibtex]
    @TechReport{ Ral19,
    author  = {Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Separation, Inverse Optimization, and Decomposition}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/InversePrimalSeparation-PKU18.pdf}
    ,
    year = {2019},
    }
  • [Download PDF] 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 (to appear), 2019. [Bibtex]
    @Article{ TahRalDeN19,
    software  = {https://github.com/tkralphs/MibS},
    author  = {Tahernejad, S. and Ralphs, T.K. and DeNegre, S.T.},
    institution  = {COR@L Technical Report 16T-015-R5},
    journal  = {Mathematical Programming Computation (to appear)},
    title = {{A Branch-and-Cut Algorithm for Mixed Integer Bilevel
    Linear Optimization Problems and Its Implementation}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MIBLP16.pdf},
    year = {2019},
    }
  • [Download PDF] T. K. Ralphs, “Duality, Branch and Bound, and Parametric Valid Inequalities,” Working Paper, COR@L Laboratory, Lehigh University 2019. [Bibtex]
    @TechReport{ Ral19-1,
    author  = {Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Duality, Branch and Bound, and Parametric Valid
    Inequalities}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/ParametricInequalities-INFORMS17.pdf}
    ,
    year = {2019},
    }

2018

  • [Download PDF] T. Chen, F. E. Curtis, and D. P. Robinson, “FaRSA for $\ell_1$-Regularized Convex Optimization: Local Convergence and Numerical Experience,” Optimization Methods and Software, vol. 33, iss. 2, p. 396–415, 2018. [Bibtex]
    @article{ChenCurtRobi18,
    author = {Chen, T. and Curtis, F. E. and Robinson, D. P.},
    title = {{FaRSA for $\ell_1$-Regularized Convex Optimization: Local Convergence and Numerical Experience}},
    journal = {{Optimization Methods and Software}},
    volume = {33},
    number = {2},
    pages = {396--415},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/ChenCurtRobi18.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, A. Wächter, and V. M. Zavala, “A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints,” SIAM Journal on Optimization, vol. 28, iss. 1, p. 930–958, 2018. [Bibtex]
    @article{CurtWaecZava18,
    author = {Curtis, F. E. and W\"achter, A. and Zavala, V. M.},
    title = {{A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints}},
    journal = {{SIAM Journal on Optimization}},
    volume = {28},
    number = {1},
    pages = {930--958},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtWaecZava18.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and W. Guo, “$R$-Linear Convergence of Limited Memory Steepest Descent,” IMA Journal of Numerical Analysis, vol. 38, iss. 2, p. 720–742, 2018. [Bibtex]
    @article{CurtGuo18,
    author = {Curtis, F. E. and Guo, W.},
    title = {{$R$-Linear Convergence of Limited Memory Steepest Descent}},
    journal = {{IMA Journal of Numerical Analysis}},
    volume = {38},
    number = {2},
    pages = {720--742},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtGuo18.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] L. Bottou, F. E. Curtis, and J. Nocedal, “Optimization Methods for Large-Scale Machine Learning,” SIAM Review, vol. 60, iss. 2, p. 223–311, 2018. [Bibtex]
    @article{BottCurtNoce18,
    author = {Bottou, L. and Curtis, F. E. and Nocedal, J.},
    title = {{Optimization Methods for Large-Scale Machine Learning}},
    journal = {{SIAM Review}},
    volume = {60},
    number = {2},
    pages = {223--311},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/BottCurtNoce18.pdf},
    papercite = {2. Review Articles}
    }
  • [Download PDF] F. E. Curtis, D. P. Robinson, and M. Samadi, “Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization,” SIAM Journal on Optimization, vol. 28, iss. 2, p. 1533–1563, 2018. [Bibtex]
    @article{CurtRobiSama18a,
    author = {Curtis, F. E. and Robinson, D. P. and Samadi, M.},
    title = {{Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization}},
    journal = {{SIAM Journal on Optimization}},
    volume = {28},
    number = {2},
    pages = {1533--1563},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRobiSama18a.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] A. U. Raghunathan, F. E. Curtis, Y. Takaguchi, and H. Hashimoto, “Fast Market Clearing Algorithms,” in Energy Markets and Responsive Grids, Springer, 2018, p. 155–175. [Bibtex]
    @incollection{RaghCurtTakaHash18,
    author = {Raghunathan, A. U. and Curtis, F. E. and Takaguchi, Y. and Hashimoto, H.},
    title = {{Fast Market Clearing Algorithms}},
    booktitle = {{Energy Markets and Responsive Grids}},
    publisher = {Springer},
    chapter = {7},
    pages = {155--175},
    year = {2018},
    url = {https://www.springer.com/us/book/9781493978212},
    papercite = {4. Conference Articles}
    }
  • [Download PDF] F. E. Curtis, Z. Lubberts, and D. P. Robinson, “Concise Complexity Analyses for Trust Region Methods,” Optimization Letters, vol. 12, iss. 8, p. 1713–1724, 2018. [Bibtex]
    @article{CurtLubbRobi18,
    author = {Curtis, F. E. and Lubberts, Z. and Robinson, D. P.},
    title = {{Concise Complexity Analyses for Trust Region Methods}},
    journal = {{Optimization Letters}},
    volume = {12},
    number = {8},
    pages = {1713--1724},
    year = {2018},
    url = {https://rdcu.be/1qGH},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, D. P. Robinson, and M. Samadi, “An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\mathcal{O}(\epsilon^{-3/2})$ for Nonconvex Optimization,” IMA Journal of Numerical Analysis, vol. 10.1093/imanum/dry022, 2018. [Bibtex]
    @article{CurtRobiSama18b,
    author = {Curtis, F. E. and Robinson, D. P. and Samadi, M.},
    title = {{An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\mathcal{O}(\epsilon^{-3/2})$ for Nonconvex Optimization}},
    journal = {{IMA Journal of Numerical Analysis}},
    volume = {10.1093/imanum/dry022},
    number = {},
    pages = {},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRobiSama18b.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and D. P. Robinson, “Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization,” COR@L Laboratory, Department of ISE, Lehigh University, 18T-003, 2018. [Bibtex]
    @techreport{CurtRobi20,
    author = {Curtis, F. E. and Robinson, D. P.},
    title = {{Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization}},
    institution = {COR@L Laboratory, Department of ISE, Lehigh University},
    number = {18T-003},
    year = {2018},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRobi20.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] W. Gao, D. Goldfarb, and F. E. Curtis, ADMM for Multiaffine Constrained Optimization, 2018. [Bibtex]
    @unpublished{GaoGoldCurt18,
    author = {Gao, W. and Goldfarb, D. and Curtis, F. E.},
    title = {{ADMM for Multiaffine Constrained Optimization}},
    note = {arXiv 1802.09592},
    year = {2018},
    url = {https://arxiv.org/abs/1802.09592},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] J. V. Burke, F. E. Curtis, H. Wang, and J. Wang, A Dynamic Penalty Parameter Updating Strategy for Matrix-Free Sequential Quadratic Optimization, 2018. [Bibtex]
    @unpublished{BurkCurtWangWang18,
    author = {Burke, J. V. and Curtis, F. E. and Wang, H. and Wang, J.},
    title = {{A Dynamic Penalty Parameter Updating Strategy for Matrix-Free Sequential Quadratic Optimization}},
    note = {arXiv 1803.09224},
    year = {2018},
    url = {https://arxiv.org/abs/1803.09224},
    papercite = {3. Journal Articles}
    }
  • [DOI] [Download PDF] 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, 2018, p. 283–336. [Bibtex]
    @InCollection{ RalShiBerKoc18,
    author  = {Ralphs, T.K. and Shinano, Y. and Berthold, T. and Koch,
    T.},
    booktitle  = {Handbook of Parallel Constraint Reasoning},
    chapter  = {8},
    doi = {https://doi.org/10.1007/978-3-319-63516-3_8},
    editor  = {Hamadi, Y and Sais, L},
    organization  = {COR@L Laboratory Report 16T-014-R3, Lehigh University},
    pages = {283--336},
    publisher  = {Springer Berlin / Heidelberg},
    title = {{Parallel Solvers for Mixed Integer Linear Programing}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ParallelMILPSurvey16.pdf}
    ,
    year = {2018},
    }
  • M. Walter and T. K. Ralphs, “Algorithms for Inverse Mixed Integer Programming,” Working Paper, COR@L Laboratory, Lehigh University 2018. [Bibtex]
    @TechReport{ WalRal18,
    author  = {Walter, M. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Algorithms for Inverse Mixed Integer Programming}},
    year = {2018},
    }
  • [Download PDF] T. K. Ralphs, “Multistage Discrete Optimization,” Working Paper, COR@L Laboratory, Lehigh University 2018. [Bibtex]
    @TechReport{ Ral18,
    author  = {Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Multistage Discrete Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/BILEVEL-IWOBIP16.pdf}
    ,
    year = {2018},
    }

2017

  • [Download PDF] F. E. Curtis, T. Mitchell, and M. L. Overton, “A BFGS-SQP Method for Nonsmooth, Nonconvex, Constrained Optimization and its Evaluation using Relative Minimization Profiles,” Optimization Methods and Software, vol. 32, iss. 1, p. 148–181, 2017. [Bibtex]
    @article{CurtMitcOver17,
    author = {Curtis, F. E. and Mitchell, T. and Overton, M. L.},
    title = {{A BFGS-SQP Method for Nonsmooth, Nonconvex, Constrained Optimization and its Evaluation using Relative Minimization Profiles}},
    journal = {{Optimization Methods and Software}},
    volume = {32},
    number = {1},
    pages = {148--181},
    year = {2017},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtMitcOver17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, D. P. Robinson, and M. Samadi, “A Trust Region Algorithm with a Worst-Case Iteration Complexity of ${\cal O}(\epsilon^{-3/2})$ for Nonconvex Optimization,” Mathematical Programming, vol. 162, iss. 1, p. 1–32, 2017. [Bibtex]
    @article{CurtRobiSama17,
    author = {Curtis, F. E. and Robinson, D. P. and Samadi, M.},
    title = {{A Trust Region Algorithm with a Worst-Case Iteration Complexity of ${\cal O}(\epsilon^{-3/2})$ for Nonconvex Optimization}},
    journal = {{Mathematical Programming}},
    volume = {162},
    number = {1},
    pages = {1--32},
    year = {2017},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRobiSama17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] T. Chen, F. E. Curtis, and D. P. Robinson, “A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions,” SIAM Journal on Optimization, vol. 27, iss. 3, p. 1583–1610, 2017. [Bibtex]
    @article{ChenCurtRobi17,
    author = {Chen, T. and Curtis, F. E. and Robinson, D. P.},
    title = {{A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions}},
    journal = {{SIAM Journal on Optimization}},
    volume = {27},
    number = {3},
    pages = {1583--1610},
    year = {2017},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/ChenCurtRobi17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, N. I. M. Gould, D. P. Robinson, and P. L. Toint, “An Interior-Point Trust-Funnel Algorithm for Nonlinear Optimization,” Mathematical Programming, vol. 161, iss. 1, p. 73–134, 2017. [Bibtex]
    @article{CurtGoulRobiToin17,
    author = {Curtis, F. E. and Gould, N. I. M. and Robinson, D. P. and Toint, Ph. L.},
    title = {{An Interior-Point Trust-Funnel Algorithm for Nonlinear Optimization}},
    journal = {{Mathematical Programming}},
    volume = {161},
    number = {1},
    pages = {73--134},
    year = {2017},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtGoulRobiToin17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and A. U. Raghunathan, “Solving Nearly-Separable Quadratic Optimization Problems as Nonsmooth Equations,” Computational Optimization and Applications, vol. 67, iss. 2, p. 317–360, 2017. [Bibtex]
    @article{CurtRagh17,
    author = {Curtis, F. E. and Raghunathan, A. U.},
    title = {{Solving Nearly-Separable Quadratic Optimization Problems as Nonsmooth Equations}},
    journal = {{Computational Optimization and Applications}},
    volume = {67},
    number = {2},
    pages = {317--360},
    year = {2017},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtRagh17.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and K. Scheinberg, “Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning,” in INFORMS Tutorials in Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), 2017, p. 89–114. [Bibtex]
    @incollection{CurtSche17,
    author = {Curtis, F. E. and Scheinberg, K.},
    title = {{Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning}},
    booktitle = {{INFORMS Tutorials in Operations Research}},
    publisher = {Institute for Operations Research and the Management Sciences (INFORMS)},
    chapter = {5},
    pages = {89--114},
    year = {2017},
    url = {http://pubsonline.informs.org/doi/abs/10.1287/educ.2017.0168},
    papercite = {2. Review Articles}
    }
  • [Download PDF] 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. [Bibtex]
    @InProceedings{ MilRalSte17,
    author  = {Miltenberger, M. and Ralphs, T.K. and Steffy, D.},
    booktitle  = {Operations Research Proceedings: 2017},
    publisher  = {Springer Berlin / Heidelberg},
    title = {{Exploring the Numerics of Branch-and-Cut for Mixed
    Integer Linear Optimization}},
    url = {https://opus4.kobv.de/opus4-zib/files/6464/numerics{\_}in{\_}mip.pdf}
    ,
    year = {2017},
    }
  • 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,
    author  = {Pfetsch, M.E. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Towards More "Scientific" Computations in Mathematical
    Optimization}},
    year = {2017},
    }
  • [Download PDF] A. Bulut and T. K. Ralphs, “DisCO: An Open Source Solver for Discrete Conic Optimization,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Bibtex]
    @TechReport{ BulRal17,
    software  = {https://github.com/aykutbulut/DisCO},
    author  = {Bulut, A. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{DisCO: An Open Source Solver for Discrete Conic
    Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/DisCO-INFORMS17.pdf}
    ,
    year = {2017},
    }
  • [Download PDF] A. Bulut and T. K. Ralphs, “Complexity for Mathematical Programs,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Bibtex]
    @TechReport{ BulRal17-1,
    author  = {Bulut, A. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Complexity for Mathematical Programs}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/MIP12.pdf},
    year = {2017},
    }
  • 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,
    author  = {DeNegre, S.T. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{Computational Experience Solving Mixed Integer
    Interdiction Problems}},
    year = {2017},
    }
  • [Download PDF] M. V. Galati and T. K. Ralphs, “DIP: A Framework for Decomposition in Integer Programming,” Working Paper, COR@L Laboratory, Lehigh University 2017. [Bibtex]
    @TechReport{ GalRal17,
    software  = {https://projects.coin-or.org/Dip},
    author  = {Galati, M.V. and Ralphs, T.K.},
    institution  = {Working Paper, COR@L Laboratory, Lehigh University},
    title = {{DIP: A Framework for Decomposition in Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/talks/DecompCSIRO11.pdf}
    ,
    year = {2017},
    }
  • J. A. Sefair, C. Y. Méndez, O. Babat, A. L. Medaglia, and L. F. Zuluaga, “Linear solution schemes for mean-semivariance project portfolio selection problems: an application in the oil and gas industry,” Omega, vol. 68, p. 39–48, 2017. [Bibtex]
    @article{sefair2016linear,
    title={Linear solution schemes for Mean-SemiVariance Project portfolio selection problems: An application in the oil and gas industry},
    author={Sefair, Jorge A and M{\'e}ndez, Carlos Y and Babat, Onur and Medaglia, Andr{\'e}s L and Zuluaga, Luis F},
    journal={Omega},
    volume = {68},
    pages = {39--48},
    year = {2017},
    publisher={Elsevier}
    }

2016

  • [Download PDF] F. E. Curtis, N. I. M. Gould, H. Jiang, and D. P. Robinson, “Adaptive Augmented Lagrangian Methods: Algorithms and Practical Numerical Experience,” Optimization Methods and Software, vol. 31, iss. 1, p. 157–186, 2016. [Bibtex]
    @article{CurtGoulJianRobi16,
    author = {Curtis, F. E. and Gould, N. I. M. and Jiang, H. and Robinson, D. P.},
    title = {{Adaptive Augmented Lagrangian Methods: Algorithms and Practical Numerical Experience}},
    journal = {{Optimization Methods and Software}},
    volume = {31},
    number = {1},
    pages = {157--186},
    year = {2016},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtGoulJianRobi16.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and W. Guo, “Handling Nonpositive Curvature in a Limited Memory Steepest Descent Method,” IMA Journal of Numerical Analysis, vol. 36, iss. 2, p. 717–742, 2016. [Bibtex]
    @article{CurtGuo16,
    author = {Curtis, F. E. and Guo, W.},
    title = {{Handling Nonpositive Curvature in a Limited Memory Steepest Descent Method}},
    journal = {{IMA Journal of Numerical Analysis}},
    volume = {36},
    number = {2},
    pages = {717--742},
    year = {2016},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtGuo16.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and Z. Han, “Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves,” SIAM Journal on Optimization, vol. 26, iss. 4, p. 2261–2283, 2016. [Bibtex]
    @article{CurtHan16,
    author = {Curtis, F. E. and Han, Z.},
    title = {{Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves}},
    journal = {{SIAM Journal on Optimization}},
    volume = {26},
    number = {4},
    pages = {2261--2283},
    year = {2016},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtHan16.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, “A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization,” in Proceedings of the 33rd International Conference on Machine Learning, New York, NY, USA, 2016. [Bibtex]
    @conference{Curt16,
    author = {Curtis, F. E.},
    title = {{A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization}},
    booktitle = {{Proceedings of the 33rd International Conference on Machine Learning}},
    publisher = {JMLR},
    address = {New York, NY, USA},
    year = {2016},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/Curt16.pdf},
    papercite = {4. Conference Articles}
    }
  • [Download PDF] A. U. Raghunathan, F. E. Curtis, Y. Takaguchi, and H. Hashimoto, “Accelerating Convergence to Competitive Equilibrium in Electricity Markets,” in IEEE Power and Energy Society General Meeting, 2016. [Bibtex]
    @conference{RaghCurtTakaHash16,
    author = {Raghunathan, A. U. and Curtis, F. E. and Takaguchi, Y. and Hashimoto, H.},
    title = {{Accelerating Convergence to Competitive Equilibrium in Electricity Markets}},
    booktitle = {{IEEE Power and Energy Society General Meeting}},
    year = {2016},
    url = {http://ieeexplore.ieee.org/document/7741162/},
    papercite = {4. Conference Articles}
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ ZhaSnyRalXue16,
    abstract  = {{\textcopyright} 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.},
    author  = {Zhang, Y. and Snyder, L.V. and Ralphs, T.K. and Xue, Z.},
    doi = {10.1016/j.tre.2016.07.002},
    issn = {13665545},
    journal  = {Transportation Research Part E: Logistics and
    Transportation Review},
    keywords  = {Bilevel optimization,Competitive location,Facility
    disruptions,Local search,Variable neighborhood search},
    title = {{The Competitive Facility Location Problem Under
    Disruption Risks}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CFLPD16.pdf},
    volume  = {93},
    year = {2016},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ BelGoePolRalTer16,
    abstract  = {{\textcopyright} 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.},
    software  = {https://github.com/aykutbulut/CGL-CONIC},
    author  = {Belotti, P. and G{\'o}ez, J.C. and P{\'{o}}lik, I. and
    Ralphs, T.K. and Terlaky, T.},
    doi = {10.1016/j.disopt.2016.10.001},
    issn = {15725286},
    journal  = {Discrete Optimization},
    keywords  = {Disjunctive conic cuts,Disjunctive programming,Mixed
    integer optimization,Second order cone optimization},
    title = {{A Complete Characterization of Disjunctive Conic Cuts for
    Mixed Integer Second Order Cone Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ConicCuts14.pdf}
    ,
    volume  = {24},
    year = {2016},
    }
  • X. Kuang, B. Ghaddar, J. Naoum-Sawaya, and L. Zuluaga, “Alternative LP and SOCP hierarchies for ACOPF problems,” Ieee transactions on power systems, 2016. [Bibtex]
    @article{kuang2016alternative,
    title={Alternative {LP} and {SOCP} hierarchies for {ACOPF} problems},
    author={Kuang, Xiaolong and Ghaddar, Bissan and Naoum-Sawaya, Joe and Zuluaga, Luis},
    journal={IEEE Transactions on Power Systems},
    year = {2016},
    note={available at \url{http://ieeexplore.ieee.org/document/7585098/?reload=true}},
    publisher={IEEE}
    }
  • M. M. Moarefdoost, A. J. Lamadrid, and L. F. Zuluaga, “A robust model for the ramp-constrained economic dispatch problem with uncertain renewable energy,” Energy economics, vol. 56, p. 310–325, 2016. [Bibtex]
    @article{moarefdoost2016robust,
    title={A robust model for the ramp-constrained economic dispatch problem with uncertain renewable energy},
    author={Moarefdoost, M Mohsen and Lamadrid, Alberto J and Zuluaga, Luis F},
    journal={Energy Economics},
    volume={56},
    pages={310--325},
    year = {2016},
    publisher={Elsevier}
    }
  • R. Howley, R. Storer, J. Vera, and L. F. Zuluaga, “Computing semiparametric bounds on the expected payments of insurance instruments via column generation,” Variance, 2016. [Bibtex]
    @article{howley2016computing,
    title={Computing semiparametric bounds on the expected payments of insurance instruments via column generation},
    author={Howley, Robert and Storer, Robert and Vera, Juan and Zuluaga, Luis F},
    journal={Variance},
    note = {available at \url{https://arxiv.org/abs/1601.02149}},
    year = {2016},
    }

2015

  • [Download PDF] J. V. Burke, F. E. Curtis, H. Wang, and J. Wang, “Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets,” SIAM Journal on Optimization, vol. 25, iss. 1, p. 261–294, 2015. [Bibtex]
    @article{BurkCurtWangWang15,
    author = {Burke, J. V. and Curtis, F. E. and Wang, H. and Wang, J.},
    title = {{Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets}},
    journal = {{SIAM Journal on Optimization}},
    volume = {25},
    number = {1},
    pages = {261--294},
    year = {2015},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/BurkCurtWangWang15.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, Z. Han, and D. P. Robinson, “A Globally Convergent Primal-Dual Active-Set Framework for Large-Scale Convex Quadratic Optimization,” Computational Optimization and Applications, vol. 60, iss. 2, p. 311–341, 2015. [Bibtex]
    @article{CurtHanRobi15,
    author = {Curtis, F. E. and Han, Z. and Robinson, D. P.},
    title = {{A Globally Convergent Primal-Dual Active-Set Framework for Large-Scale Convex Quadratic Optimization}},
    journal = {{Computational Optimization and Applications}},
    volume = {60},
    number = {2},
    pages = {311--341},
    year = {2015},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtHanRobi15.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, H. Jiang, and D. P. Robinson, “An Adaptive Augmented Lagrangian Method for Large-Scale Constrained Optimization,” Mathematical Programming, vol. 152, iss. 1–2, p. 201–245, 2015. [Bibtex]
    @article{CurtJianRobi15,
    author = {Curtis, F. E. and Jiang, H. and Robinson, D. P.},
    title = {{An Adaptive Augmented Lagrangian Method for Large-Scale Constrained Optimization}},
    journal = {{Mathematical Programming}},
    volume = {152},
    number = {1--2},
    pages = {201--245},
    year = {2015},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtJianRobi15.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and X. Que, “A Quasi-Newton Algorithm for Nonconvex, Nonsmooth Optimization with Global Convergence Guarantees,” Mathematical Programming Computation, vol. 7, iss. 4, p. 399–428, 2015. [Bibtex]
    @article{CurtQue15,
    author = {Curtis, F. E. and Que, X.},
    title = {{A Quasi-Newton Algorithm for Nonconvex, Nonsmooth Optimization with Global Convergence Guarantees}},
    journal = {{Mathematical Programming Computation}},
    volume = {7},
    number = {4},
    pages = {399--428},
    year = {2015},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtQue15.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and Z. Han, Primal-Dual Active-Set Methods for Isotonic Regression and Trend Filtering, 2015. [Bibtex]
    @unpublished{CurtHan15,
    author = {Curtis, F. E. and Han, Z.},
    title = {{Primal-Dual Active-Set Methods for Isotonic Regression and Trend Filtering}},
    note = {arXiv 1508.02452},
    year = {2015},
    url = {http://arxiv.org/abs/1508.02452},
    papercite = {6. Technical Reports}
    }
  • [Download PDF] A. Bulut and T. K. Ralphs, “On the Complexity of Inverse Mixed Integer Linear Optimization,” COR@L Laboratory Report 15T-001-R3, Lehigh University 2015. [Bibtex]
    @TechReport{ BulRal15,
    software  = {https://github.com/tkralphs/CuPPy},
    author  = {Bulut, A. and Ralphs, T.K.},
    institution  = {COR@L Laboratory Report 15T-001-R3, Lehigh University},
    title = {{On the Complexity of Inverse Mixed Integer Linear
    Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/InverseMILP15.pdf}
    ,
    year = {2015},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @InProceedings{ BelGoePolRalTer15,
    abstract  = {{\textcopyright} 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.},
    author  = {Belotti, P. and G{\'o}ez, J.C. and P{\'{o}}lik, I. and
    Ralphs, T.K. and Terlaky, T.},
    booktitle  = {Numerical Analysis and Optimization},
    doi = {10.1007/978-3-319-17689-5_1},
    isbn = {9783319176888},
    issn = {21941017},
    keywords  = {Conic cuts,Mixed integer optimization,Second order cone
    Optimization},
    title = {{A Conic Representation of the Convex Hull of Disjunctive
    Sets and Conic Cuts for Integer Second Order Cone
    Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ConicCuts12.pdf}
    ,
    volume  = {134},
    year = {2015},
    }
  • [Download PDF] T. K. Ralphs, “Data Science and Analytics,” Industrial and Systems Engineering Report 15T-009, Lehigh University 2015. [Bibtex]
    @TechReport{ Ral15,
    author  = {Ralphs, T.K.},
    institution  = {Industrial and Systems Engineering Report 15T-009, Lehigh
    University},
    title = {{Data Science and Analytics}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/dataScience.pdf}
    ,
    year = {2015},
    }
  • J. Pena, J. C. Vera, and L. F. Zuluaga, “Completely positive reformulations for polynomial optimization,” Mathematical programming, vol. 151, iss. 2, p. 405–431, 2015. [Bibtex]
    @article{pena2015completely,
    title={Completely positive reformulations for polynomial optimization},
    author={Pena, Javier and Vera, Juan C and Zuluaga, Luis F},
    journal={Mathematical Programming},
    volume={151},
    number={2},
    pages={405--431},
    year = {2015},
    publisher={Springer}
    }
  • X. Chen, D. Du, and L. F. Zuluaga, “Copula-based randomized mechanisms for truthful scheduling on two unrelated machines,” Theory of computing systems, vol. 57, iss. 3, p. 753–781, 2015. [Bibtex]
    @article{chen2015copula,
    title={Copula-based randomized mechanisms for truthful scheduling on two unrelated machines},
    author={Chen, Xujin and Du, Donglei and Zuluaga, Luis F},
    journal={Theory of Computing Systems},
    volume={57},
    number={3},
    pages={753--781},
    year = {2015},
    publisher={Springer}
    }
  • X. Kuang, L. F. Zuluaga, B. Ghaddar, and J. Naoum-Sawaya, “Approximating the ACOPF problem with a hierarchy of SOCP problems,” in 2015 ieee power & energy society general meeting, 2015, p. 1–5. [Bibtex]
    @inproceedings{kuang2015approximating,
    title={Approximating the {ACOPF} problem with a hierarchy of {SOCP} problems},
    author={Kuang, Xiaolong and Zuluaga, Luis F and Ghaddar, Bissan and Naoum-Sawaya, Joe},
    booktitle={2015 IEEE Power \& Energy Society General Meeting},
    pages={1--5},
    year = {2015},
    organization={IEEE}
    }

2014

  • [Download PDF] J. V. Burke, F. E. Curtis, and H. Wang, “A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection,” SIAM Journal on Optimization, vol. 24, iss. 2, p. 839–872, 2014. [Bibtex]
    @article{BurkCurtWang14,
    author = {Burke, J. V. and Curtis, F. E. and Wang, H.},
    title = {{A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection}},
    journal = {{SIAM Journal on Optimization}},
    volume = {24},
    number = {2},
    pages = {839--872},
    year = {2014},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/BurkCurtWang14.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, T. Johnson, D. P. Robinson, and A. Wächter, “An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization,” SIAM Journal on Optimization, vol. 24, iss. 3, p. 1041–1074, 2014. [Bibtex]
    @article{CurtJohnRobiWaec14,
    author = {Curtis, F. E. and Johnson, T. and Robinson, D. P. and W\"achter, A.},
    title = {{An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization}},
    journal = {{SIAM Journal on Optimization}},
    volume = {24},
    number = {3},
    pages = {1041--1074},
    year = {2014},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtJohnRobiWaec14.pdf},
    papercite = {3. Journal Articles}
    }
  • L. V. Snyder, “A tight approximation for a continuous-review inventory model with supplier disruptions,” International journal of production economics, 2014. [Bibtex]
    @article{SnyderEOQD,
    author={Snyder, L. V. },
    title={A tight approximation for a continuous-review inventory model with supplier disruptions},
    journal={International Journal of Production Economics},
    year = {2014},
    }
  • L. V. Snyder and M. M. Moarefdoost, “Robust layouts for ocean wave energy farms,” in Marine energy technology symposium (mets), 2014. [Bibtex]
    @inproceedings{SnyderMoarefdoost,
    author={Snyder, L. V. and M. Mohsen Moarefdoost},
    title={Robust layouts for ocean wave energy farms},
    booktitle={Marine Energy Technology Symposium (METS)},
    year = {2014},
    }
  • Z. Atan and L. V. Snyder, “EOQ models with supply disruptions,” in EOQ inventory problems: stochastic and deterministic models and applications, T. -M. Choi, Ed., New York: Springer, 2014, pp. 43-55. [Bibtex]
    @incollection{AtanSnyder14,
    author={Atan, Z. and L. V. Snyder},
    title={{EOQ} models with supply disruptions},
    booktitle={{EOQ} Inventory Problems: Stochastic and Deterministic Models and Applications},
    editor={T.-M. Choi},
    publisher={New York: Springer},
    chapter={3},
    pages={43-55},
    year = {2014},
    }
  • A. J. Schmitt, S. A. Sun, L. V. Snyder, and Z. -J. M. Shen, “Centralization versus decentralization: Risk pooling, risk diversification, and supply uncertainty in a one-warehouse multiple-retailer system,” 2014. [Bibtex]
    @techreport{SchmittSunSnyderShen,
    author={Schmitt, A. J. and S. A. Sun and L. V. Snyder and Z.-J. M. Shen},
    title={{Centralization versus decentralization: Risk pooling, risk diversification, and supply uncertainty in a one-warehouse multiple-retailer system}},
    institution={},
    year = {2014},
    month={January},
    note={Under revision},
    }
  • L. V. Snyder, “$q$-factor optimization for 2-WEC arrays,” {Lehigh University Dept. of Industrial and Systems Engineering Tech Report \#14T-001} 2014. [Bibtex]
    @techreport{Snyder-qfactor14,
    author={Snyder, L. V.},
    title={$q$-Factor optimization for 2-{WEC} arrays},
    institution={{Lehigh University Dept. of Industrial and Systems Engineering Tech Report \#14T-001}},
    year = {2014},
    }
  • Z. Horvth, Y. Song, and T. Terlaky, “Invariance preserving discretization of dynamical systems,” Siam journal on control and optimization (submitted), 2014. [Bibtex]
    @Article{2014,
    Title = {Invariance Preserving Discretization of Dynamical Systems},
    Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
    Journal = {SIAM Journal on Control and Optimization (Submitted)},
    year = {2014},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, “Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron.,” Discrete and continuous dynamical systems (submitted), 2014. [Bibtex]
    @Article{Horvth2014,
    Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
    Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
    Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
    year = {2014},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, “The iteration-complexity upper bound for the mizuno-todd-ye predictor-corrector algorithm is tight,” Mathematical programming (submitted), 2014. [Bibtex]
    @Article{Mut2014,
    Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
    Author = {Mut, M. and Terlaky, T.},
    Journal = {Mathematical Programming (Submitted)},
    year = {2014},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • T. Terlaky and Z. Wang, “On the identification of the optimal partition of second order cone optimization problems,” Siam journal on optimization, vol. 24, iss. 1, p. 385–414, 2014. [Bibtex]
    @Article{Terlaky2014,
    Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
    Author = {Terlaky, T. and Wang, Z.},
    Journal = {SIAM Journal on Optimization},
    year = {2014},
    Number = {1},
    Pages = {385--414},
    Volume = {24},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • [Download PDF] 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 Report 14T-004, Lehigh University 2014. [Bibtex]
    @TechReport{ HasRal14,
    software  = {https://github.com/tkralphs/ValueFunction},
    author  = {Hassanzadeh, A. and Ralphs, T.K.},
    institution  = {COR@L Laboratory Report 14T-004, Lehigh University},
    title = {{On the Value Function of a Mixed Integer Linear
    Optimization Problem and an Algorithm for Its
    Construction}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILPValueFunction14.pdf}
    ,
    year = {2014},
    }
  • [Download PDF] T. K. Ralphs, M. Guzelsoy, and A. Mahajan, “SYMPHONY Version 5.6 User’s Manual,” COR@L Laboratory, Lehigh University 2014. [Bibtex]
    @TechReport{ RalGuzMah14,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Guzelsoy, M. and Mahajan, A.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.6 User's Manual}},
    url = {https://coin-or.github.io/SYMPHONY/doc/SYMPHONY-5.6.17-Manual.pdf}
    ,
    year = {2014},
    }
  • [DOI] [Download PDF] A. Lodi, T. K. Ralphs, and G. Woeginger, “Bilevel Programming and the Separation Problem,” Mathematical programming, vol. 148, p. 437–458, 2014. [Bibtex]
    @Article{ LodRalWoe14,
    author  = {Lodi, A. and Ralphs, T.K. and Woeginger, G.},
    doi = {10.1007/s10107-013-0700-x},
    journal  = {Mathematical Programming},
    pages = {437--458},
    title = {{Bilevel Programming and the Separation Problem}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BilevelSeparation12.pdf}
    ,
    volume  = {148},
    year = {2014},
    }
  • [Download PDF] A. Hassanzadeh and T. K. Ralphs, “A Generalization of Benders’ Algorithm for Two-Stage Stochastic Optimization Problems with Mixed Integer Recourse,” COR@L Laboratory Report 14T-005, Lehigh University 2014. [Bibtex]
    @TechReport{ HasRal14-1,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Hassanzadeh, A. and Ralphs, T.K.},
    institution  = {COR@L Laboratory Report 14T-005, Lehigh University},
    title = {{A Generalization of Benders' Algorithm for Two-Stage
    Stochastic Optimization Problems with Mixed Integer
    Recourse}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/SMILPGenBenders14.pdf}
    ,
    year = {2014},
    }
  • Q. Han, D. Du, and L. F. Zuluaga, “Technical note: A risk-and ambiguity-averse extension of the max-min newsvendor order formula,” Operations research, vol. 62, iss. 3, p. 535–542, 2014. [Bibtex]
    @article{han2014technical,
    title={Technical note: {A} risk-and ambiguity-averse extension of the max-min newsvendor order formula},
    author={Han, Qiaoming and Du, Donglei and Zuluaga, Luis F},
    journal={Operations Research},
    volume={62},
    number={3},
    pages={535--542},
    year = {2014},
    publisher={INFORMS}
    }

2013

  • [Download PDF] F. E. Curtis and X. Que, “An Adaptive Gradient Sampling Algorithm for Nonsmooth Optimization,” Optimization Methods and Software, vol. 28, iss. 6, p. 1302–1324, 2013. [Bibtex]
    @article{CurtQue13,
    author = {Curtis, F. E. and Que, X.},
    title = {{An Adaptive Gradient Sampling Algorithm for Nonsmooth Optimization}},
    journal = {{Optimization Methods and Software}},
    volume = {28},
    number = {6},
    pages = {1302--1324},
    year = {2013},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtQue13.pdf},
    papercite = {3. Journal Articles}
    }
  • C. Chen, L. He, P. Venkitasubramaniam, S. Kishore, and L. V. Snyder, “Achievable privacy in aggregate residential energy management systems,” Journal of energy engineering, 2013. [Bibtex]
    @article{ChenHeVenkitasubramaniamKishoreSnyder,
    author={Chen, C. and L. He and P. Venkitasubramaniam and S. Kishore and L. V. Snyder},
    title={Achievable privacy in aggregate residential energy management systems},
    journal={Journal of Energy Engineering},
    year = {2013},
    }
  • C. Chen, K. G. Nagananda, G. Xiong, S. Kishore, and L. V. Snyder., “A communication-based appliance scheduling scheme for consumer-premise energy management systems,” Ieee transactions on smart grid, vol. 4, iss. 1, pp. 56-65, 2013. [Bibtex]
    @article{ChenNaganandaXiongKishoreSnyder13,
    author={Chen, C. and K. G. Nagananda and G. Xiong and S. Kishore and L. V. Snyder.},
    title={A communication-based appliance scheduling scheme for consumer-premise energy management systems},
    journal={IEEE Transactions on Smart Grid},
    volume={4},
    number={1},
    pages={56-65},
    year = {2013},
    }
  • C. L. Latifoglu, P. Belotti, and L. V. Snyder, “Models for production planning under power interruptions,” Naval research logistics, vol. 60, iss. 5, pp. 413-431, 2013. [Bibtex]
    @article{LatifogluBelottiSnyder13,
    author={Latifoglu, C. L. and P. Belotti and L. V. Snyder},
    title={Models for production planning under power interruptions},
    journal={Naval Research Logistics},
    volume={60},
    number={5},
    pages={413-431},
    year = {2013},
    }
  • F. Chen, L. V. Snyder, and S. Kishore, “Efficient algorithms and policies for demand response scheduling,” 2013. [Bibtex]
    @techreport{ChenSnyderKishore,
    author={Chen, F. and L. V. Snyder and S. Kishore},
    title={Efficient algorithms and policies for demand response scheduling},
    institution={},
    year = {2013},
    month={December},
    note={Under revision},
    }
  • Y. Rong, Z. Atan, and L. V. Snyder, “Heuristics for base-stock levels in multi-echelon distribution networks with first-come first-served policies,” 2013. [Bibtex]
    @techreport{RongAtanSnyder,
    author={Rong, Y. and Z. Atan and L. V. Snyder},
    title={{Heuristics for base-stock levels in multi-echelon distribution networks with first-come first-served policies}},
    institution={},
    year = {2013},
    month={December},
    note={Under revision},
    }
  • Z. Atan, L. V. Snyder, and G. Wilson, “Lateral transshipment and rationing policies for multi-retailer systems,” 2013. [Bibtex]
    @techreport{AtanSnyderWilson,
    author={Atan, Z. and L. V. Snyder and G. Wilson},
    title={{Lateral transshipment and rationing policies for multi-retailer systems}},
    institution={},
    year = {2013},
    month={December},
    note={},
    }
  • L. V. Snyder, “Multi-period optimal power flow problems,” Optima, vol. 93, pp. 8-9, 2013. [Bibtex]
    @article{SnyderOptima13,
    author={Snyder, L. V},
    title={Multi-period optimal power flow problems},
    journal={Optima},
    pages={8-9},
    volume={93},
    year = {2013},
    month={December},
    }
  • S. Kishore, L. V. Snyder, and P. Pradhan, “Electricity from ocean wave energy: Technologies, opportunities and challenges,” Ieee smart grid newsletter, 2013. [Bibtex]
    @article{KishoreSnyderPradhan13,
    author={Kishore, S. and L. V. Snyder and P. Pradhan},
    title={{Electricity from ocean wave energy: Technologies, opportunities and challenges}},
    journal={IEEE Smart Grid Newsletter},
    year = {2013},
    month={February},
    }
  • D. Li and T. Terlaky, “The duality between the perceptron algorithm and the von neumann algorithm,” Mopta proceedings, 2013. [Bibtex]
    @Article{li2012duality,
    Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
    Author = {Li, Dan and Terlaky, Tam{\'a}s},
    Journal = {MOPTA Proceedings},
    year = {2013},
    }
  • M. Mut and T. Terlaky, “An analogue of the klee-walkup result for sonnevend’s curvature of the central path,” , 2013. [Bibtex]
    @Article{mut2013analogue,
    Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
    Author = {Mut, Murat and Terlaky, Tam{\'a}s},
    year = {2013},
    }
  • M. Mut and T. Terlaky, “A tight iteration-complexity upper bound for the mty predictor-corrector algorithm via redundant klee-minty cubes,” , 2013. [Bibtex]
    @Article{mut2013tight,
    Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
    Author = {Mut, Murat and Terlaky, Tam{\'a}s},
    year = {2013},
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, “A novel marker enhancement lter (mef) for uoroscopic images,” Iccr proceedings (submitted), 2013. [Bibtex]
    @Article{2013,
    Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
    Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
    Journal = {ICCR Proceedings (Submitted)},
    year = {2013},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • R. Sotirov and T. Terlaky, “Multi-start approach for an integer determinant maximization problem,” Optimization, vol. 62, iss. 1, p. 101–114, 2013. [Bibtex]
    @Article{sotirov2013multi,
    Title = {Multi-start approach for an integer determinant maximization problem},
    Author = {Sotirov, R and Terlaky, T},
    Journal = {Optimization},
    year = {2013},
    Number = {1},
    Pages = {101--114},
    Volume = {62},
    Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, “Comments on: recent progress on the combinatorial diameter of polytopes and simplicial complexes,” Top, vol. 21, iss. 3, p. 461 – 467, 2013. [Bibtex]
    @Article{Terlaky2013,
    Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
    Author = {Terlaky, T.},
    Journal = {TOP},
    year = {2013},
    Month = {October},
    Number = {3},
    Pages = {461 -- 467},
    Volume = {21},
    Owner = {jgoez},
    Timestamp = {2014.09.02}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, “Special issue in honour of professor kees roos’ 70th birthday,” Optimization methods and software, vol. 28, iss. 3, p. 393–395, 2013. [Bibtex]
    @Article{terlaky2013special,
    Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
    Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
    Journal = {Optimization Methods and Software},
    year = {2013},
    Number = {3},
    Pages = {393--395},
    Volume = {28},
    Publisher = {Taylor \& Francis}
    }
  • [Download PDF] T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY Version 5.5 User’s Manual,” COR@L Laboratory, Lehigh University 2013. [Bibtex]
    @TechReport{ RalGuzMah13,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.5 User's Manual}},
    url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.5.0-Manual.pdf}
    ,
    year = {2013},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ BelGoePolRalTer13,
    author  = {Belotti, P. and Goez, J.C. and Polik, I. and Ralphs, T.K.
    and Terlaky, T.},
    doi = {10.1016/j.dam.2013.05.017},
    journal  = {Discrete Applied Mathematics},
    pages = {2778--2793},
    title = {{On Families of Quadratic Surfaces Having Fixed
    Intersection with Two Hyperplanes}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/Quadratic11.pdf}
    ,
    volume  = {161},
    year = {2013},
    }
  • [DOI] [Download PDF] J. Wang and T. 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. [Bibtex]
    @InProceedings{ WanRal13,
    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.
    {\textcopyright} Springer-Verlag 2013.},
    software  = {https://projects.coin-or.org/Dip},
    author  = {Wang, J. and Ralphs, T.},
    booktitle  = {Proceedings of the Conference on Constraint Programming,
    Artificial Intelligence, and Operations Research},
    doi = {10.1007/978-3-642-38171-3_31},
    isbn = {9783642381706},
    issn = {03029743},
    pages = {394--402},
    title = {{Computational Experience with Hypergraph-based Methods
    for Automatic Decomposition in Discrete Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CPAIOR12.pdf}
    ,
    year = {2013},
    }
  • [DOI] [Download PDF] K. L. Hoffman and T. K. Ralphs, “Integer and Combinatorial Optimization,” 2013. [Bibtex]
    @TechReport{ HofRal13,
    author  = {Hoffman, K.L. and Ralphs, T.K.},
    booktitle  = {Encyclopedia of Operations Research and Management
    Science},
    doi = {10.1007/978-1-4419-1153-7_129},
    pages = {771--783},
    publisher  = {Springer},
    title = {{Integer and Combinatorial Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ICO-EORMS11.pdf}
    ,
    year = {2013},
    }
  • S. H. Cox, Y. Lin, R. Tian, and L. F. Zuluaga, “Mortality portfolio risk management,” Journal of risk and insurance, vol. 80, iss. 4, p. 853–890, 2013. [Bibtex]
    @article{cox2013mortality,
    title={Mortality portfolio risk management},
    author={Cox, Samuel H and Lin, Yijia and Tian, Ruilin and Zuluaga, Luis F},
    journal={Journal of Risk and Insurance},
    volume={80},
    number={4},
    pages={853--890},
    year = {2013},
    publisher={Wiley Online Library}
    }
  • X. Chen, D. Du, and L. F. Zuluaga, “Copula-based randomized mechanisms for truthful scheduling on two unrelated machines,” in Algorithmic game theory lecture notes in computer science, 2013, p. 231–242. [Bibtex]
    @inproceedings{Du2015copula,
    title={Copula-based randomized mechanisms for truthful scheduling on two unrelated machines},
    author={Chen, Xujin and Du, Donglei and Zuluaga, Luis F},
    booktitle={Algorithmic Game Theory Lecture Notes in Computer Science},
    volume={8146},
    pages={231--242},
    year = {2013},
    }

2012

  • [Download PDF] P. Belotti, M. Devarasetty, and A. and Sardella, “Comparison of mpls and ethernet networks at the access-aggregation level,” 2012. [Bibtex]
    @techreport{multicomm-ethvmpls,
    title = {Comparison of MPLS and Ethernet networks at the access-aggregation level},
    author = {Pietro Belotti and Muralidhar Devarasetty and and Alan Sardella},
    year = {2012},
    url = {http://myweb.clemson.edu/~pbelott/papers/comparison-eth-mpls.pdf}
    }
  • [Download PDF] P. Belotti, S. Cafieri, J. Lee, and L. Liberti, “On feasibility based bounds tightening,” Submitted, 2012. [Bibtex]
    @article{fbbt-lp,
    url = {http://www.optimization-online.org/DB_HTML/2012/01/3325.html},
    title = {On feasibility based bounds tightening},
    year = {2012},
    journal = {Submitted},
    author = {P. Belotti and S. Cafieri and J. Lee and L. Liberti},
    }
  • [DOI] [Download PDF] P. Belotti, “Bound reduction using pairs of linear inequalities,” Journal of global optimization, 2012. [Bibtex]
    @article{BelottiTwoImpl2011,
    author = {P. Belotti},
    title = {Bound reduction using pairs of linear inequalities},
    year = {2012},
    journal = {Journal of Global Optimization},
    url = {{http://www.springerlink.com/content/t858n3x17u30h221}},
    doi = {DOI: 10.1007/s10898-012-9848-9}
    }
  • [DOI] [Download PDF] P. Belotti, “Disjunctive cuts for non-convex MINLP,” in Mixed integer nonlinear programming, Springer, 2012, vol. 154, pp. 117-144. [Bibtex]
    @INCOLLECTION{Belotti09,
    author = {P. Belotti},
    title = {Disjunctive cuts for non-convex {MINLP}},
    url = {{http://myweb.clemson.edu/{~}pbelott/papers/belotti-disj-MINLP.pdf}},
    publisher = {Springer},
    year = {2012},
    booktitle = {Mixed Integer Nonlinear Programming},
    series = {The IMA Volumes in Mathematics and its Applications},
    volume = 154,
    pages = {117-144},
    doi = {10.1007/978-1-4614-1927-3}
    }
  • [DOI] [Download PDF] A. Qualizza, P. Belotti, and F. Margot, “Linear programming relaxations of quadratically constrained quadratic programs,” in Mixed integer nonlinear programming, Springer, 2012, vol. 154, pp. 407-426. [Bibtex]
    @INCOLLECTION{BMQ09,
    author = {A. Qualizza and P. Belotti and F. Margot},
    title = {Linear Programming Relaxations of Quadratically Constrained Quadratic Programs},
    url = {http://wpweb2.tepper.cmu.edu/fmargot/PDF/sdp.pdf},
    publisher = {Springer},
    year = {2012},
    booktitle = {Mixed Integer Nonlinear Programming},
    series = {The IMA Volumes in Mathematics and its Applications},
    volume = 154,
    pages = {407-426},
    doi = {10.1007/978-1-4614-1927-3}
    }
  • [Download PDF] F. E. Curtis, “A Penalty-Interior-Point Algorithm for Nonlinear Constrained Optimization,” Mathematical Programming Computation, vol. 4, iss. 2, p. 181–209, 2012. [Bibtex]
    @article{Curt12,
    author = {Curtis, F. E.},
    title = {{A Penalty-Interior-Point Algorithm for Nonlinear Constrained Optimization}},
    journal = {{Mathematical Programming Computation}},
    volume = {4},
    number = {2},
    pages = {181--209},
    year = {2012},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/Curt12.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, J. Huber, O. Schenk, and A. Wächter, “A Note on the Implementation of an Interior-Point Algorithm for Nonlinear Optimization with Inexact Step Computations,” Mathematical Programming, Series B, vol. 136, iss. 1, p. 209–227, 2012. [Bibtex]
    @article{CurtHubeScheWaec12,
    author = {Curtis, F. E. and Huber, J. and Schenk, O. and W\"{a}chter, A.},
    title = {{A Note on the Implementation of an Interior-Point Algorithm for Nonlinear Optimization with Inexact Step Computations}},
    journal = {{Mathematical Programming, Series B}},
    volume = {136},
    number = {1},
    pages = {209--227},
    year = {2012},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtHubeScheWaec12.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and M. L. Overton, “A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization,” SIAM Journal on Optimization, vol. 22, iss. 2, p. 474–500, 2012. [Bibtex]
    @article{CurtOver12,
    author = {Curtis, F. E. and Overton, M. L.},
    title = {{A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization}},
    journal = {{SIAM Journal on Optimization}},
    volume = {22},
    number = {2},
    pages = {474--500},
    year = {2012},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtOver12.pdf},
    papercite = {3. Journal Articles}
    }
  • Modeling and Optimization: Theory and Applications – Selected Contributions from the MOPTA 2010 Conference, T. Terlaky and F. E. Curtis, Eds., New York, NY, USA: Springer, 2012. [Bibtex]
    @book{TerlCurt12,
    editor = {Terlaky, T. and Curtis, F. E.},
    title = {{Modeling and Optimization: Theory and Applications -- Selected Contributions from the MOPTA 2010 Conference}},
    publisher = {Springer},
    address = {New York, NY, USA},
    series = {Springer Proceedings in Mathematics and Statistics},
    year = {2012},
    papercite = {1. Edited Volumes}
    }
  • A. Schmitt and L. V. Snyder, “Infinite-horizon models for inventory control under yield uncertainty and disruptions,” Computers and operations research, vol. 39, iss. 4, pp. 850-862, 2012. [Bibtex]
    @article{SchmittSnyder12,
    author={Schmitt, A. and L. V. Snyder},
    title={Infinite-horizon models for inventory control under yield uncertainty and disruptions},
    journal={Computers and Operations Research},
    volume={39},
    number={4},
    pages={850-862},
    year = {2012},
    }
  • C. Chen, K. G. Nagananda, G. Xiong, S. Kishore, and L. V. Snyder, “Analysis of a joint access and scheduling scheme for residential energy management controller,” in 7th IEEE Sensor Array Multichannel (SAM) Signal Processing Workshop, 2012, pp. 21-24. [Bibtex]
    @inproceedings{ChenNaganandaXiongKishoreSnyder12,
    author={Chen, C. and K. G. Nagananda and G. Xiong and S. Kishore and L. V. Snyder},
    title={Analysis of a joint access and scheduling scheme for residential energy management controller},
    booktitle={{7th IEEE Sensor Array Multichannel (SAM) Signal Processing Workshop}},
    pages={21-24},
    year = {2012},
    }
  • Z. Atan and L. V. Snyder, “Inventory strategies to manage supply disruptions,” in Supply chain disruptions: theory and practice of managing risk, H. Gurnani A. Mehrotra and S. Ray, Eds., Berlin: Springer-Verlag, 2012, pp. 115-139. [Bibtex]
    @incollection{AtanSnyder12,
    author={Atan, Z. and L. V. Snyder},
    title={Inventory strategies to manage supply disruptions},
    booktitle={Supply Chain Disruptions: Theory and Practice of Managing Risk},
    editor={H. Gurnani, A. Mehrotra, and S. Ray},
    publisher={Berlin: Springer-Verlag},
    chapter={5},
    pages={115-139},
    year = {2012},
    }
  • L. V. Snyder, Z. Atan, P. Peng, Y. Rong, A. Schmitt, and B. Sinsoysal, “OR/MS models for supply chain disruptions: A review,” 2012. [Bibtex]
    @techreport{SnyderAtanPengRongSchmittSinsoysal,
    author={Snyder, L. V. and Z. Atan and P. Peng and Y. Rong and A. Schmitt and B. Sinsoysal},
    title={{OR/MS models for supply chain disruptions: A review}},
    institution={},
    year = {2012},
    month={November},
    note={Under revision},
    }
  • Z. Atan and L. V. Snyder, “Disruptions in one-warehouse multiple-retailer systems,” 2012. [Bibtex]
    @techreport{AtanSnyder,
    author={Z. Atan and L. V. Snyder},
    title={Disruptions in one-warehouse multiple-retailer systems},
    institution={},
    year = {2012},
    month={November},
    note={Submitted for publication},
    }
  • D. Shishebori, L. V. Snyder, and M. S. Jabalameli, “A reliable budget-constrained facility location/network design problem with unreliable facilities,” 2012. [Bibtex]
    @techreport{ShisheboriSnyderJabalameli,
    author={Shishebori, D. and L. V. Snyder and M. S. Jabalameli},
    title={{A reliable budget-constrained facility location/network design problem with unreliable facilities}},
    institution={},
    year = {2012},
    month={November},
    note={Under revision},
    }
  • T. Seyhan and L. V. Snyder, “A new heuristic formulation for a competitive maximal covering location problem,” 2012. [Bibtex]
    @techreport{SeyhanSnyder,
    author={Seyhan, T. and L. V. Snyder},
    title={A new heuristic formulation for a competitive maximal covering location problem},
    institution={},
    month={January},
    year = {2012},
    note={Under revision},
    }
  • [Download PDF] P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, “A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization,” Optimization online, 2012. [Bibtex]
    @Article{belotti2012conic,
    Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
    Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
    Journal = {Optimization Online},
    year = {2012},
    Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, “Convex approximations in stochastic programming by semidefinite programming,” Annals of operations research, vol. 200, iss. 1, p. 171–182, 2012. [Bibtex]
    @Article{deak2012convex,
    Title = {Convex approximations in stochastic programming by semidefinite programming},
    Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
    Journal = {Annals of Operations Research},
    year = {2012},
    Number = {1},
    Pages = {171--182},
    Volume = {200},
    Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, “Global routing in vlsi design algorithms, theory, and computational practice,” Jcmcc-journal of combinatorial mathematicsand combinatorial computing, vol. 80, p. 71, 2012. [Bibtex]
    @Article{deza2012global,
    Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
    Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
    Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
    year = {2012},
    Pages = {71},
    Volume = {80},
    Publisher = {Citeseer}
    }
  • M. Mut and T. Terlaky, “On the volumetric path,” Optimization letters, vol. 6, iss. 4, p. 687–693, 2012. [Bibtex]
    @Article{mut2012volumetric,
    Title = {On the volumetric path},
    Author = {Mut, Murat and Terlaky, Tam{\'a}s},
    Journal = {Optimization Letters},
    year = {2012},
    Number = {4},
    Pages = {687--693},
    Volume = {6},
    Publisher = {Springer}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, “Multiobjective optimization via parametric optimization: models, algorithms, and applications,” in Modeling and optimization: theory and applications, Springer, 2012, p. 77–119. [Bibtex]
    @InCollection{romanko2012multiobjective,
    Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
    Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
    Booktitle = {Modeling and Optimization: Theory and Applications},
    Publisher = {Springer},
    year = {2012},
    Pages = {77--119}
    }
  • M. Salahi and T. Terlaky, “Self-regular interior-point methods for semidefinite optimization,” in Handbook on semidefinite, conic and polynomial optimization, Springer, 2012, p. 437–454. [Bibtex]
    @InCollection{salahi2012self,
    Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
    Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
    Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
    Publisher = {Springer},
    year = {2012},
    Pages = {437--454}
    }
  • T. Terlaky and F. E. Curtis, Modeling and optimization: theory and applications; selected contributions from the mopta 2010 conference, Springer, 2012, vol. 21. [Bibtex]
    @Book{terlaky2012modeling,
    Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
    Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
    Publisher = {Springer},
    year = {2012},
    Volume = {21}
    }
  • [Download PDF] M. V. Galati, T. K. Ralphs, and J. Wang, “Computational Experience with Generic Decomposition using the DIP Framework,” in Proceedings of ramp 2012, 2012. [Bibtex]
    @InProceedings{ GalRalWan12,
    software  = {https://projects.coin-or.org/Dip},
    author  = {Galati, M.V. and Ralphs, T.K. and Wang, J.},
    booktitle  = {Proceedings of RAMP 2012},
    title = {{Computational Experience with Generic Decomposition using
    the DIP Framework}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/RAMP12.pdf},
    year = {2012},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ KocRalShi12,
    author  = {Koch, T. and Ralphs, T.K. and Shinano, Y.},
    doi = {10.1007/s00186-012-0390-9},
    journal  = {Mathematical Methods of Operations Research},
    pages = {67--93},
    title = {{Could We Use a Million Cores to Solve an Integer
    Program?}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/Million11.pdf}
    ,
    volume  = {76},
    year = {2012},
    }
  • J. Peña, J. C. Vera, and L. F. Zuluaga, “Computing arbitrage upper bounds on basket options in the presence of bid–ask spreads,” European journal of operational research, vol. 222, iss. 2, p. 369–376, 2012. [Bibtex]
    @article{pena2012computing,
    title={Computing arbitrage upper bounds on basket options in the presence of bid--ask spreads},
    author={Pe{\~n}a, Javier and Vera, Juan C and Zuluaga, Luis F},
    journal={European Journal of Operational Research},
    volume={222},
    number={2},
    pages={369--376},
    year = {2012},
    publisher={Elsevier}
    }
  • A. M. Villegas, A. L. Medaglia, and L. F. Zuluaga, “Computing bounds on the expected payoff of alternative risk transfer products,” Insurance: mathematics and economics, vol. 51, iss. 2, p. 271–281, 2012. [Bibtex]
    @article{villegas2012computing,
    title={Computing bounds on the expected payoff of alternative risk transfer products},
    author={Villegas, Andr{\'e}s M and Medaglia, Andr{\'e}s L and Zuluaga, Luis F},
    journal={Insurance: Mathematics and Economics},
    volume={51},
    number={2},
    pages={271--281},
    year = {2012},
    publisher={Elsevier}
    }

2011

  • [Download PDF] P. Belotti, A. J. Miller, and M. Namazifar, “Linear inequalities for bounded products of variables,” Siag/opt views-and-news, vol. 22, iss. 1, 2011. [Bibtex]
    @article{BelottiMN2011,
    year = {2011},
    title = {Linear inequalities for bounded products of variables},
    number = 1,
    volume = 22,
    author = {P. Belotti and A.J. Miller and M. Namazifar},
    journal = {SIAG/OPT Views-and-News},
    url = {http://www.neos-guide.org/NEOS/images/a/aa/ViewsAndNews-22(1).pdf}
    }
  • [Download PDF] G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, and A. Wächter, “A probing algorithm for minlp with failure prediction by svm,” in 8th international cpaior conference, berlin, germany, may 23-27, 2011. proceedings, 2011, pp. 154-169. [Bibtex]
    @inproceedings{NanniciniBLLMW11,
    author = {G. Nannicini and
    P. Belotti and
    J. Lee and
    J. Linderoth and
    F. Margot and
    A. W{\"a}chter},
    title = {A Probing Algorithm for MINLP with Failure Prediction by
    SVM},
    year = {2011},
    url = {http://wpweb2.tepper.cmu.edu/fmargot/PDF/rc25103.pdf},
    pages = {154-169},
    editor = {Tobias Achterberg and
    J. Christopher Beck},
    booktitle = {8th International
    CPAIOR Conference, Berlin, Germany, May 23-27, 2011.
    Proceedings},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    volume = {6697},
    year = {2011},
    isbn = {978-3-642-21310-6},
    ee = {http://dx.doi.org/10.1007/978-3-642-21311-3},
    bibsource = {DBLP, http://dblp.uni-trier.de}
    }
  • [Download PDF] N. Touati-Moungla, P. Belotti, V. Jost, and L. Liberti, “A branch-and-price algorithm for the risk-equity constrained routing problem,” in Network optimization, J. Pahl, T. Reiners, and S. Voß, Eds., Springer Berlin / Heidelberg, 2011, vol. 6701, pp. 439-449. [Bibtex]
    @incollection {Touati-MounglaBJL2011,
    author = {Touati-Moungla, N. and Belotti, P. and Jost, V. and Liberti, L.},
    title = {A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem},
    booktitle = {Network Optimization},
    series = {Lecture Notes in Computer Science},
    editor = {Pahl, Julia and Reiners, Torsten and Vo{\ss}, Stefan},
    publisher = {Springer Berlin / Heidelberg},
    keyword = {Computer Science},
    pages = {439-449},
    volume = {6701},
    url = {http://dx.doi.org/10.1007/978-3-642-21527-8_49},
    year = {2011},
    }
  • [Download PDF] P. Belotti, S. Cafieri, J. Lee, L. Liberti, and A. Miller, “On the composition of convex envelopes for quadrilinear terms,” Submitted, 2011. [Bibtex]
    @article{BelottiCLLM2011,
    url = {http://www.lix.polytechnique.fr/~liberti/quarticbook.pdf},
    author="P. Belotti and S. Cafieri and J. Lee and L. Liberti and A. Miller",
    title = {On the composition of convex envelopes for quadrilinear terms},
    journal = {Submitted},
    year = {2011},
    }
  • P. Peng, L. V. Snyder, Z. Liu, and A. Lim, “Reliable logistics networks design with facility disruptions,” Transportation research-part b, vol. 45, iss. 8, pp. 1190-1211, 2011. [Bibtex]
    @article{PengSnyderLiuLim11,
    author={Peng, P. and L. V. Snyder and Z. Liu and A. Lim},
    title={Reliable logistics networks design with facility disruptions},
    journal={Transportation Research-Part B},
    volume={45},
    number={8},
    pages={1190-1211},
    year = {2011},
    }
  • C. Chen, S. Kishore, and L. V. Snyder, “An innovative RTP-based residential power scheduling scheme for smart grids,” in IEEE Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2011, pp. 5956-5959. [Bibtex]
    @inproceedings{ChenKishoreSnyder11,
    author={Chen, C. and S. Kishore and L. V. Snyder},
    title={An innovative {RTP}-based residential power scheduling scheme for smart grids},
    booktitle={{IEEE Conference on Acoustics, Speech, and Signal Processing (ICASSP)}},
    pages={5956-5959},
    year = {2011},
    }
  • L. V. Snyder, “Introduction to facility location,” in Wiley encyclopedia of operations research and management science, J. J. Cochran, Ed., New York: Wiley, 2011. [Bibtex]
    @incollection{Snyder11,
    author={Snyder, L. V},
    title={Introduction to facility location},
    booktitle={Wiley Encyclopedia of Operations Research and Management Science},
    editor={J. J. Cochran},
    publisher={New York: Wiley},
    year = {2011},
    }
  • L. V. Snyder, “Covering problems,” in Foundations of location analysis, H. A. Eiselt and V. Marianov, Eds., Berlin: Springer-Verlag, 2011, pp. 109-135. [Bibtex]
    @incollection{SnyderCovering11,
    author={Snyder, L. V},
    title={Covering problems},
    booktitle={Foundations of Location Analysis},
    editor={H. A. Eiselt and V. Marianov},
    publisher={Berlin: Springer-Verlag},
    chapter={6},
    pages={109-135},
    year = {2011},
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, “Optimizing the gverse rf pulse sequence: an evaluation of two competitive software algorithms,” Algorithmic operations research, vol. 6, iss. 1, p. Pages–1, 2011. [Bibtex]
    @Article{anand2011optimizing,
    Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
    Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
    Journal = {Algorithmic Operations Research},
    year = {2011},
    Number = {1},
    Pages = {Pages--1},
    Volume = {6}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, “On families of quadratic surfaces having fixed intersections with two hyperplanes,” Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering 2011. [Bibtex]
    @TechReport{belotti2011families,
    Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
    Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
    Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
    year = {2011},
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, “An interior point constraint generation algorithm for semi-infinite optimization with health-care application,” Operations research, vol. 59, iss. 5, p. 1184–1197, 2011. [Bibtex]
    @Article{oskoorouchi2011interior,
    Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
    Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
    Journal = {Operations research},
    year = {2011},
    Number = {5},
    Pages = {1184--1197},
    Volume = {59},
    Publisher = {INFORMS}
    }
  • [Download PDF] A. Lodi, T. K. Ralphs, F. Rossi, and S. Smriglio, “Interdiction Branching,” COR@L Technical Report 11T-012-R2 2011. [Bibtex]
    @TechReport{ LodRalRosSmr11,
    software  = {https://github.com/tkralphs/InterdictionBranch},
    author  = {Lodi, A. and Ralphs, T.K. and Rossi, F. and Smriglio, S.},
    institution  = {COR@L Technical Report 11T-012-R2},
    title = {{Interdiction Branching}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BilevelBranching.pdf}
    ,
    year = {2011},
    }
  • M. Güzelsoy and T. K. Ralphs, “Warm-starting for Real-time Vehicle Routing,” COR@L Laboratory, Lehigh University 2011. [Bibtex]
    @TechReport{ GuzRal11,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{Warm-starting for Real-time Vehicle Routing}},
    year = {2011},
    }
  • [Download PDF] T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY Version 5.4 User’s Manual,” COR@L Laboratory, Lehigh University 2011. [Bibtex]
    @TechReport{ RalGuzMah11,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.4 User's Manual}},
    url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.4.0-Manual.pdf}
    ,
    year = {2011},
    }
  • [Download PDF] T. K. Ralphs, M. Güzelsoy, and A. Mahajan, “SYMPHONY Version 5.3 User’s Manual,” COR@L Laboratory, Lehigh University 2011. [Bibtex]
    @TechReport{ RalGuzMah11-1,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M. and Mahajan, A.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.3 User's Manual}},
    url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.3.4-Manual.pdf}
    ,
    year = {2011},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ KocAchAndBasBerBixDanGamGleHei.ea11,
    software  = {http://miplib.zib.de/download/scriptversions/},
    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.},
    doi = {10.1007/s12532-011-0025-9},
    journal  = {Mathematical Programming Computation},
    pages = {103--163},
    title = {{MIPLIB 2010}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/miplib5.pdf},
    volume  = {3},
    year = {2011},
    }

2010

  • [DOI] [Download PDF] P. Belotti, L. Liberti, A. Lodi, G. Nannicini, and A. Tramontani, “Disjunctive inequalities: applications and extensions,” in Encyclopedia of operations research and management science, C. J. et al., Ed., Hoboken NJ: John Wiley and Sons, 2010. [Bibtex]
    @INCOLLECTION {BelottiLLNT2010,
    author = {P. Belotti and L. Liberti and A. Lodi and G. Nannicini and A. Tramontani},
    title = {Disjunctive Inequalities: Applications and Extensions},
    booktitle = {Encyclopedia of Operations Research and Management Science},
    publisher = {John Wiley and Sons},
    editor = {J. Cochran et al.},
    address = {Hoboken NJ},
    year = {2010},
    doi = {10.1002/9780470400531.eorms0537},
    url = {http://www.lix.polytechnique.fr/~liberti/disjineqs.pdf},
    }
  • [Download PDF] A. Altin, P. Belotti, and M. Ç. Pinar, “OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty,” Optimization and engineering, vol. 11, iss. 3, pp. 395-422, 2010. [Bibtex]
    @article{AltinBP2008,
    author = {A. Altin and P. Belotti and M.{\c{C}}. Pinar},
    title = {{OSPF} Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty},
    journal = {Optimization and Engineering},
    volume = 11,
    number = 3,
    year = {2010},
    pages = {395-422},
    url = {{http://www.springerlink.com/content/n091227462217737}}
    }
  • [Download PDF] P. Belotti, S. Cafieri, J. Lee, and L. Liberti, “Feasibility-based bounds tightening via fixed points,” in Combinatorial optimization and applications, W. Wu and O. Daescu, Eds., Springer Berlin/Heidelberg, 2010, vol. 6508, pp. 65-76. [Bibtex]
    @incollection{BelottiCLL2010,
    author="P. Belotti and S. Cafieri and J. Lee and L. Liberti",
    title="Feasibility-based bounds tightening via fixed points",
    booktitle="Combinatorial Optimization and Applications",
    series="Lecture Notes in Computer Science",
    editor="W. Wu and O. Daescu",
    publisher="Springer Berlin/Heidelberg",
    pages="65-76",
    volume=6508,
    year = {2010},
    url="http://www.springerlink.com/content/lm11k89jt0171284"
    }
  • [Download PDF] R. H. Byrd, F. E. Curtis, and J. Nocedal, “An Inexact Newton Method for Nonconvex Equality Constrained Optimization,” Mathematical Programming, vol. 122, iss. 2, p. 273–299, 2010. [Bibtex]
    @article{ByrdCurtNoce10a,
    author = {Byrd, R. H. and Curtis, F. E. and Nocedal, J.},
    title = {{An Inexact Newton Method for Nonconvex Equality Constrained Optimization}},
    journal = {{Mathematical Programming}},
    volume = {122},
    number = {2},
    pages = {273--299},
    year = {2010},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/ByrdCurtNoce10a.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] R. H. Byrd, F. E. Curtis, and J. Nocedal, “Infeasibility Detection and SQP Methods for Nonlinear Optimization,” SIAM Journal on Optimization, vol. 20, iss. 5, p. 2281–2299, 2010. [Bibtex]
    @article{ByrdCurtNoce10b,
    author = {Byrd, R. H. and Curtis, F. E. and Nocedal, J.},
    title = {{Infeasibility Detection and SQP Methods for Nonlinear Optimization}},
    journal = {{SIAM Journal on Optimization}},
    volume = {20},
    number = {5},
    pages = {2281--2299},
    year = {2010},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/ByrdCurtNoce10b.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis, O. Schenk, and A. Wächter, “An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations,” SIAM Journal on Scientific Computing, vol. 32, iss. 6, p. 3447–3475, 2010. [Bibtex]
    @article{CurtScheWaec10,
    author = {Curtis, F. E. and Schenk, O. and W\"{a}chter, A.},
    title = {{An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations}},
    journal = {{SIAM Journal on Scientific Computing}},
    volume = {32},
    number = {6},
    pages = {3447--3475},
    year = {2010},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtScheWaec10.pdf},
    papercite = {3. Journal Articles}
    }
  • B. Gemici, J. T. Linderoth, S. D. Wu, and J. Moore, “R&d project portfolio analysis for the semiconductor industry,” Operations research, 2010. [Bibtex]
    @article{gemici.et.al:10,
    author = "B. Gemici and J. T. Linderoth and S. D. Wu and J. Moore",
    title = "R\&D Project Portfolio Analysis for the Semiconductor Industry",
    year = {2010},
    journal = "Operations Research",
    note = "To appear",
    }
  • K. Abhishek, S. Leyffer, and J. T. Linderoth, “FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs,” INFORMS journal on computing, 2010. [Bibtex]
    @article{abhishek.leyffer.linderoth:10-1,
    author = "K. Abhishek and S. Leyffer and J. T. Linderoth",
    title = "{FilMINT}: {An} Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs",
    journal = "{INFORMS} Journal on Computing",
    year = {2010},
    note = "To appear",
    }
  • K. Abhishek, S. Leyffer, and J. T. Linderoth, “Modeling without categorical variables: a mixed integer nonlinear program for the optimization of thermal insulation systems,” Optimization and engineering, 2010. [Bibtex]
    @article{abhishek.leyffer.linderoth:10-2,
    author = "K. Abhishek and S. Leyffer and J. T. Linderoth",
    title = "Modeling Without Categorical Variables: A Mixed Integer Nonlinear Program for the Optimization of Thermal Insulation Systems",
    journal = "Optimization and Engineering",
    year = {2010},
    note = "To appear",
    }
  • [Download PDF] M. B. Freimer, D. J. Thomas, and J. T. Linderoth, “Reducing bias in stochastic linear programs with sampling methods,” Computational optimization and applications (to appear), 2010. [Bibtex]
    @article{freimer.et.al:10,
    author = "M.B. Freimer and D.J. Thomas and J.T. Linderoth",
    title = "Reducing Bias in Stochastic Linear Programs with Sampling Methods",
    journal = "Computational Optimization and Applications (to appear)",
    url = "http://coral.ie.lehigh.edu/pubs/files/jtl3_reducing.pdf",
    year = {2010},
    }
  • Y. Rong, L. V. Snyder, and Y. Sun, “Inventory sharing under decentralized preventive transshipments,” Naval research logistics, vol. 57, iss. 6, pp. 540-562, 2010. [Bibtex]
    @article{RongSnyderSun10,
    author={Rong, Y. and L. V. Snyder and Y. Sun},
    title={Inventory sharing under decentralized preventive transshipments},
    journal={Naval Research Logistics},
    volume={57},
    number={6},
    pages={540-562},
    year = {2010},
    }
  • L. Qi, Z. -J. M. Shen, and L. V. Snyder, “The effect of supply disruptions on supply chain design decisions,” Transportation science, vol. 44, iss. 2, pp. 274-289, 2010. [Bibtex]
    @article{QiShenSnyder10,
    author={Qi, L. and Z.-J. M. Shen and L. V. Snyder},
    title={The effect of supply disruptions on supply chain design decisions},
    journal={Transportation Science},
    volume={44},
    number={2},
    pages={274-289},
    year = {2010},
    }
  • A. J. Schmitt, L. V. Snyder, and Z. -J. M. Shen, “Inventory systems with stochastic demand and supply: properties and approximations,” European journal of operational research, vol. 206, iss. 2, pp. 313-328, 2010. [Bibtex]
    @article{SchmittSnyderShen10,
    author={Schmitt, A. J. and L. V. Snyder and Z.-J. M. Shen},
    title={Inventory systems with stochastic demand and supply: Properties and approximations},
    journal={European Journal of Operational Research },
    volume={206},
    number={2},
    pages={313-328},
    year = {2010},
    }
  • S. Kishore and L. V. Snyder, “Control mechanisms for residential electricity demand in SmartGrids,” in Ieee smart grid communications conference (smartgridcomm), 2010, pp. 4-6. [Bibtex]
    @inproceedings{KishoreSnyder10,
    author={Kishore, S. and L. V. Snyder},
    title={Control mechanisms for residential electricity demand in {SmartGrids}},
    booktitle={IEEE Smart Grid Communications Conference (SmartGridComm)},
    pages={4-6},
    year = {2010},
    month={October},
    }
  • [DOI] [Download PDF] A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, “Bi-parametric convex quadratic optimization,” Optimization methods software, vol. 25, p. 229–245, 2010. [Bibtex]
    @Article{Ghaffari-Hadigheh2010,
    Title = {Bi-parametric convex quadratic optimization},
    Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
    Journal = {Optimization Methods Software},
    year = {2010},
    Month = {April},
    Pages = {229--245},
    Volume = {25},
    Acmid = {1744722},
    Address = {Bristol, PA, USA},
    Doi = {http://dx.doi.org/10.1080/10556780903239568},
    ISSN = {1055-6788},
    Issue = {2},
    Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
    Numpages = {17},
    Publisher = {Taylor \& Francis, Inc.},
    Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • W. Hare, M. Liu, and T. Terlaky, “Efficient preprocessing for vlsi optimization problems,” Computational optimization and applications, vol. 45, iss. 3, p. 475–493, 2010. [Bibtex]
    @Article{hare2010efficient,
    Title = {Efficient preprocessing for VLSI optimization problems},
    Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
    Journal = {Computational Optimization and Applications},
    year = {2010},
    Number = {3},
    Pages = {475--493},
    Volume = {45},
    Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, “A polynomial path-following interior point algorithm for general linear complementarity problems,” Journal of global optimization, vol. 47, iss. 3, p. 329–342, 2010. [Bibtex]
    @Article{Illes2010a,
    Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
    Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
    Journal = {Journal of Global Optimization},
    year = {2010},
    Number = {3},
    Pages = {329--342},
    Volume = {47},
    Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, “Polynomial interior point algorithms for general linear complementarity problems,” Algorithmic operations research, vol. 5, iss. 1, p. Pages–1, 2010. [Bibtex]
    @Article{illes2010polynomial,
    Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
    Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
    Journal = {Algorithmic Operations Research},
    year = {2010},
    Number = {1},
    Pages = {Pages--1},
    Volume = {5}
    }
  • [Download PDF] T. Illés, M. Nagy, and T. Terlaky, “A polynomial path-following interior point algorithm for general linear complementarity problems,” Journal of global optimization, vol. 47, pp. 329-342, 2010. [Bibtex]
    @Article{Illes2010,
    Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
    Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
    Journal = {Journal of Global Optimization},
    year = {2010},
    Note = {10.1007/s10898-008-9348-0},
    Pages = {329-342},
    Volume = {47},
    Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
    ISSN = {0925-5001},
    Issue = {3},
    Keyword = {Engineering},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • [Download PDF] T. Illés, M. Nagy, and T. Terlaky, “Polynomial interior point algorithms for general linear complementarity problems,” Algorithmic operations research, vol. 5, iss. 1, p. 1–12, 2010. [Bibtex]
    @Article{Illes2010b,
    Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
    Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
    Journal = {Algorithmic Operations Research},
    year = {2010},
    Number = {1},
    Pages = {1--12},
    Volume = {5},
    ISSN = {1718-3235},
    Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
    Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • M. H. Koulaei and T. Terlaky, “On the complexity analysis of a mehrotra-type primal–dual feasible algorithm for semidefinite optimization,” Optimization methods & software, vol. 25, iss. 3, p. 467–485, 2010. [Bibtex]
    @Article{koulaei2010complexity,
    Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
    Author = {Koulaei, Mohammad H and Terlaky, Tamas},
    Journal = {Optimization Methods \& Software},
    year = {2010},
    Number = {3},
    Pages = {467--485},
    Volume = {25},
    Publisher = {Taylor \& Francis}
    }
  • Y. Li and T. Terlaky, “A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with o(n$\backslash$logtr(x\^0s\^0)ïµ) iteration complexity,” Siam journal on optimization, vol. 20, iss. 6, p. 2853–2875, 2010. [Bibtex]
    @Article{li2010new,
    Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
    Author = {Li, Yang and Terlaky, Tam{\'a}s},
    Journal = {SIAM Journal on Optimization},
    year = {2010},
    Number = {6},
    Pages = {2853--2875},
    Volume = {20},
    Publisher = {SIAM}
    }
  • [Download PDF] 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. [Bibtex]
    @TechReport{ AkcBerRal10,
    annote  = {available by request},
    author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{Solution Methods for the Multi-trip Elementary Shortest
    Path Problem with Resource Constraints}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MESPPRC10.pdf}
    ,
    year = {2010},
    }
  • [DOI] [Download PDF] M. Güzelsoy and T. K. Ralphs, “Integer Programming Duality,” in Encyclopedia of operations research and management science, J. Cochran, Ed., Wiley, 2010. [Bibtex]
    @InCollection{ GuzRal10,
    author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
    booktitle  = {Encyclopedia of Operations Research and Management
    Science},
    doi = {10.1002/9780470400531},
    editor  = {{J. Cochran}},
    publisher  = {Wiley},
    title = {{Integer Programming Duality}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/Duality-EOR10.pdf}
    ,
    year = {2010},
    }
  • [DOI] [Download PDF] T. K. Ralphs and M. V. Galati, “Decomposition Methods,” in Encyclopedia of operations research and management science, J. Cochran, Ed., Wiley, 2010. [Bibtex]
    @InCollection{ RalGal10,
    author  = {Ralphs, T.K. and Galati, M.V.},
    booktitle  = {Encyclopedia of Operations Research and Management
    Science},
    doi = {10.1002/9780470400531},
    editor  = {Cochran, J.},
    publisher  = {Wiley},
    title = {{Decomposition Methods}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/Decomp-EOR10.pdf}
    ,
    year = {2010},
    }
  • [Download PDF] T. K. Ralphs, A. Mahajan, and M. Güzelsoy, “SYMPHONY Version 5.2 User’s Manual,” COR@L Laboratory, Lehigh University 2010. [Bibtex]
    @TechReport{ RalMahGuz10,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Mahajan, A. and G{\"u}zelsoy, M.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.2 User's Manual}},
    url = {http://www.coin-or.org/SYMPHONY/doc/SYMPHONY-5.2.3-Manual.pdf}
    ,
    year = {2010},
    }
  • [DOI] [Download 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. [Bibtex]
    @Article{ MahRal10,
    author  = {Mahajan, A. and Ralphs, T.K.},
    doi = {10.1137/080737587},
    journal  = {SIAM Journal on Optimization},
    number  = {5},
    pages = {2181--2198},
    title = {{On the Complexity of Selecting Disjunctions in Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/Branching08.pdf}
    ,
    volume  = {20},
    year = {2010},
    }
  • J. Peña, X. Saynac, J. C. Vera, and L. F. Zuluaga, “Computing general static-arbitrage bounds for european basket options via Dantzig-Wolfe decomposition,” Algorithmic operations research, vol. 5, iss. 2, p. 65–74, 2010. [Bibtex]
    @article{pena2010computing,
    title={Computing general static-arbitrage bounds for European basket options via {D}antzig-{W}olfe decomposition},
    author={Pe{\~n}a, Javier and Saynac, Xavier and Vera, Juan C and Zuluaga, Luis Fernando},
    journal={Algorithmic Operations Research},
    volume={5},
    number={2},
    pages={65--74},
    year = {2010},
    }
  • J. Pena, J. C. Vera, and L. F. Zuluaga, “Static-arbitrage lower bounds on the prices of basket options via linear programming,” Quantitative finance, vol. 10, iss. 8, p. 819–827, 2010. [Bibtex]
    @article{pena2010static,
    title={Static-arbitrage lower bounds on the prices of basket options via linear programming},
    author={Pena, Javier and Vera, Juan C and Zuluaga, Luis F},
    journal={Quantitative Finance},
    volume={10},
    number={8},
    pages={819--827},
    year = {2010},
    publisher={Taylor \& Francis}
    }
  • R. Tian, S. H. Cox, Y. Lin, and L. F. Zuluaga, “Portfolio risk management with CVaR-like constraints,” North american actuarial journal, vol. 14, iss. 1, p. 86–106, 2010. [Bibtex]
    @article{tian2010portfolio,
    title={Portfolio risk management with {CV}a{R}-like constraints},
    author={Tian, Ruilin and Cox, Samuel H and Lin, Yijia and Zuluaga, Luis F},
    journal={North American Actuarial Journal},
    volume={14},
    number={1},
    pages={86--106},
    year = {2010},
    publisher={Taylor \& Francis}
    }
  • L. F. Zuluaga and S. H. Cox, “Improving skewness of mean-variance portfolios,” North american actuarial journal, vol. 14, iss. 1, p. 59–67, 2010. [Bibtex]
    @article{zuluaga2010improving,
    title={Improving Skewness of Mean-Variance Portfolios},
    author={Zuluaga, Luis F and Cox, Samuel H},
    journal={North American Actuarial Journal},
    volume={14},
    number={1},
    pages={59--67},
    year = {2010},
    publisher={Taylor \& Francis}
    }
  • R. Tian, S. H. Cox, Y. Lin, and L. F. Zuluaga, “Bounds for extreme probabilities and Value at Risk,” Variance, vol. 4, iss. 1, p. 47–65, 2010. [Bibtex]
    @article{Cox2010bounds,
    title = {Bounds for Extreme Probabilities and {V}alue at {R}isk},
    author={Tian, Ruilin and Cox, Samuel H and Lin, Yijia and Zuluaga, Luis F},
    journal = {Variance},
    volume = {4},
    number = {1},
    pages = {47--65},
    year = {2010},
    }

2009

  • [Download PDF] P. Belotti, “Couenne: a user’s manual,” Lehigh University 2009. [Bibtex]
    @techreport{BelottiCouMan09,
    author = "P. Belotti",
    title = {Couenne: a user's manual},
    url = {https://projects.coin-or.org/Couenne/browser/trunk/Couenne/doc/couenne-user-manual.pdf?format=raw},
    institution = {Lehigh University},
    year = {2009},
    }
  • [Download PDF] P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, “Branching and bounds tightening techniques for non-convex minlp,” Optimization methods and software, vol. 24, iss. 4-5, pp. 597-634, 2009. [Bibtex]
    @article{BelottiLLMW09,
    author = {P. Belotti and J. Lee and L. Liberti and F. Margot and A. W{\"a}chter},
    title = {Branching and bounds tightening techniques for non-convex MINLP},
    journal = {Optimization Methods and Software},
    volume = 24,
    number = "4-5",
    year = {2009},
    pages = {597-634},
    url = {{http://www.optimization-online.org/DB_HTML/2008/08/2059.html}},
    }
  • S. Orlowski, C. Raack, A. M. C. A. Koster, G. Baier, T. Engel, and P. Belotti, “Branch-and-cut techniques for solving realistic two-layer network design problems,” in Graphs and algorithms in communication networks, A. M. C. A. Koster and X. Muñoz, Eds., Springer-Verlag, 2009, pp. 95-117. [Bibtex]
    @incollection {OrlowskiRKBEB,
    title = {Branch-and-cut techniques for solving realistic two-layer network design problems},
    author = {Orlowski, S. and Raack, C. and Koster, A.M.C.A. and Baier, G. and Engel, T. and Belotti, P. },
    editor = {Koster, A.M.C.A. and Mu{\~n}oz, Xavier},
    booktitle = {Graphs and Algorithms in Communication Networks},
    year = {2009},
    pages = {95-117},
    chapter = {3},
    publisher = {Springer-Verlag},
    }
  • A. Karabis, P. Belotti, and D. Baltas, “Optimization of catheter position and dwell time in prostate hdr brachytherapy using hipo and linear programming,” in World congress on medical physics and biomedical engineering, september 7 – 12, 2009, munich, germany, 2009, pp. 612-615. [Bibtex]
    @inproceedings{KarabisBB2009,
    editor = {Olaf D{\"o}ssel and Wolfgang C. Schlegel},
    booktitle = {World Congress on Medical Physics and Biomedical Engineering, September 7 - 12, 2009, Munich, Germany},
    publisher = {Springer},
    location = {Heidelberg},
    series = {IFMBE Proceedings},
    volume = {25/I},
    year = {2009},
    isbn = {978-3-642-03472-5},
    author = {A. Karabis and P. Belotti and D. Baltas},
    title = {Optimization of Catheter Position and Dwell Time in Prostate HDR Brachytherapy using HIPO and Linear Programming},
    pages = {612-615}
    }
  • [Download PDF] G. Panza, A. Capone, D. Pinarello, and P. Belotti, “Robustness in next-generation networks,” in ICT summit europe 2009, best paper award, Santander, Spain, 2009. [Bibtex]
    @inproceedings{PanzaCPB2009,
    author = {G. Panza and A. Capone and D. Pinarello and P. Belotti},
    title = {Robustness in Next-Generation Networks},
    booktitle = {{ICT} Summit Europe 2009, Best paper award},
    address = {Santander, Spain},
    url = {http://www.ict-optimix.eu/images/d/d7/ICTMobileSummit09.pdf},
    pages = {},
    year = {2009},
    }
  • [Download PDF] Z. Akca, R. T. Berger, and T. K. Ralphs, “Modeling and solving location, routing, and scheduling problems,” in Proceedings of the eleventh informs computing society meeting, 2009, p. 309–330. [Bibtex]
    @inproceedings{akca.berger.ralphs:09,
    author = "Akca, Z and Berger, R T and Ralphs, T K",
    booktitle = "Proceedings of the Eleventh INFORMS Computing Society Meeting",
    pages = "309--330",
    title = "Modeling and Solving Location, Routing, and Scheduling Problems",
    url = "http://coral.ie.lehigh.edu/~ted/files/papers/LRP08.pdf",
    year = {2009},
    }
  • [Download PDF] F. E. Curtis, J. Nocedal, and A. Wächter, “A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank Deficient Jacobians,” SIAM Journal on Optimization, vol. 20, iss. 3, p. 1224–1249, 2009. [Bibtex]
    @article{CurtNoceWaec09,
    author = {Curtis, F. E. and Nocedal, J. and W\"{a}chter, A.},
    title = {{A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank Deficient Jacobians}},
    journal = {{SIAM Journal on Optimization}},
    volume = {20},
    number = {3},
    pages = {1224--1249},
    year = {2009},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtNoceWaec09.pdf},
    papercite = {3. Journal Articles}
    }
  • J. Linderoth, F. Margot, and G. Thain, “Improving bounds on the football pool problem via symmetry reduction and high-throughput computing,” INFORMS journal on computing, vol. 21, pp. 445-457, 2009. [Bibtex]
    @article{linderoth.margot.thain:09,
    author = "J. Linderoth and F. Margot and G. Thain",
    title = "Improving Bounds on the Football Pool Problem via Symmetry Reduction and High-Throughput Computing",
    year = {2009},
    journal = "{INFORMS} Journal on Computing",
    volume = 21,
    pages = "445-457",
    }
  • L. Qi, Z. -J. M. Shen, and L. V. Snyder, “A continuous-review inventory model with disruptions at both supplier and retailer,” Production and operations management, vol. 18, iss. 5, pp. 516-532, 2009. [Bibtex]
    @article{QiShenSnyder09,
    author={Qi, L. and Z.-J. M. Shen and L. V. Snyder},
    title={A continuous-review inventory model with disruptions at both supplier and retailer},
    journal={Production and Operations Management},
    volume={18},
    number={5},
    pages={516-532},
    year = {2009},
    }
  • Y. Rong, Z. -J. M. Shen, and L. V. Snyder, “The impact of ordering behavior on order-quantity variability: a study of forward and reverse bullwhip effects,” Flexible services and manufacturing journal, vol. 20, iss. 1, pp. 95-124, 2009. [Bibtex]
    @article{RongShenSnyder09,
    author={Rong, Y. and Z.-J. M. Shen and L. V. Snyder},
    title={The impact of ordering behavior on order-quantity variability: A study of forward and reverse bullwhip effects},
    journal={Flexible Services and Manufacturing Journal},
    volume={20},
    number={1},
    pages={95-124},
    year = {2009},
    }
  • Y. Rong, Z. -J. M. Shen, and L. V. Snyder, “Pricing during disruptions: A cause of the reverse bullwhip effect,” 2009. [Bibtex]
    @techreport{RongShenSnyder,
    author={Rong, Y. and Z.-J. M. Shen and L. V. Snyder},
    title={{Pricing during disruptions: A cause of the reverse bullwhip effect}},
    institution={},
    year = {2009},
    month={December},
    note={Submitted for publication},
    }
  • L. V. Snyder, A. Sargent, M. Schlosser, and S. Orwan, “The software question: To buy or build?,” Cscmp supply chain quarterly, pp. 46-50, 2009. [Bibtex]
    @article{SnyderSargentSchlosserOrwan09,
    author={Snyder, L. V. and A. Sargent and M. Schlosser and S. Orwan},
    title={{The software question: To buy or build?}},
    journal={CSCMP Supply Chain Quarterly},
    pages={46-50},
    year = {2009},
    month={{Quarter 1}},
    }
  • [Download PDF] A. Deza, T. Terlaky, and Y. Zinchenko, “A continuous d-step conjecture for polytopes,” Discrete & computational geometry, vol. 41, pp. 318-327, 2009. [Bibtex]
    @Article{Deza2009,
    Title = {A Continuous d-Step Conjecture for Polytopes},
    Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
    Journal = {Discrete \& Computational Geometry},
    year = {2009},
    Note = {10.1007/s00454-008-9096-4},
    Pages = {318-327},
    Volume = {41},
    Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
    ISSN = {0179-5376},
    Issue = {2},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer New York},
    Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • [Download PDF] P. Du, J. Peng, and T. Terlaky, “Self-adaptive support vector machines: modelling and experiments,” Computational management science, vol. 6, pp. 41-51, 2009. [Bibtex]
    @Article{Du2009,
    Title = {Self-adaptive support vector machines: modelling and experiments},
    Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
    Journal = {Computational Management Science},
    year = {2009},
    Note = {10.1007/s10287-008-0071-6},
    Pages = {41-51},
    Volume = {6},
    Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
    ISSN = {1619-697X},
    Issue = {1},
    Keyword = {Business and Economics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • [Download PDF] T. Illés, M. Nagy, and T. Terlaky, “Ep theorem for dual linear complementarity problems,” Journal of optimization theory and applications, vol. 140, pp. 233-238, 2009. [Bibtex]
    @Article{Illes2009,
    Title = {EP Theorem for Dual Linear Complementarity Problems},
    Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {2009},
    Note = {10.1007/s10957-008-9440-0},
    Pages = {233-238},
    Volume = {140},
    Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
    ISSN = {0022-3239},
    Issue = {2},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • [Download PDF] T. Jiao, J. Peng, and T. Terlaky, “A confidence voting process for ranking problems based on support vector machines,” Annals of operations research, vol. 166, pp. 23-38, 2009. [Bibtex]
    @Article{Jiao2009,
    Title = {A confidence voting process for ranking problems based on support vector machines},
    Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
    Journal = {Annals of Operations Research},
    year = {2009},
    Note = {10.1007/s10479-008-0410-6},
    Pages = {23-38},
    Volume = {166},
    Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
    ISSN = {0254-5330},
    Issue = {1},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • [DOI] [Download 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. [Bibtex]
    @InProceedings{ MahRal09,
    author  = {Mahajan, A. and Ralphs, T.K.},
    booktitle  = {Proceedings of the Eleventh INFORMS Computing Society
    Meeting},
    doi = {10.1007/978-0-387-88843-9_6},
    pages = {101--118},
    title = {{Experiments with Branching using General Disjunctions}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CompBranching08.pdf}
    ,
    year = {2009},
    }
  • [DOI] [Download 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. [Bibtex]
    @InProceedings{ DeNRal09,
    software  = {https://github.com/tkralphs/MibS},
    author  = {DeNegre, S. and Ralphs, T.K.},
    booktitle  = {Proceedings of the Eleventh INFORMS Computing Society
    Meeting},
    doi = {10.1007/978-0-387-88843-9_4},
    pages = {65--78},
    title = {{A Branch-and-Cut Algorithm for Bilevel Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BILEVEL08.pdf}
    ,
    year = {2009},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @InProceedings{ AkcBerRal09,
    author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
    booktitle  = {Proceedings of the Eleventh INFORMS Computing Society
    Meeting},
    doi = {10.1007/978-0-387-88843-9_16},
    pages = {309--330},
    title = {{A Branch-and-Price Algorithm for Combined Location and
    Routing Problems Under Capacity Restrictions}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/LRP08.pdf},
    year = {2009},
    }
  • [Download PDF] 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. [Bibtex]
    @InProceedings{ LodRal09,
    author  = {Lodi, A. and Ralphs, T.K.},
    booktitle  = {Proceedings of the Cologne Twente Workshop on Graphs and
    Combinatorial Optimization},
    pages = {125--134},
    title = {{Bilevel Programming and Maximally Violated Valid
    Inequalities}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CTW09.pdf},
    year = {2009},
    }
  • [DOI] [Download 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. [Bibtex]
    @Article{ XuRalLadSal09,
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
    M.J.},
    doi = {10.1287/ijoc.1090.0347},
    journal  = {The INFORMS Journal on Computing},
    pages = {383--397},
    title = {{Computational Experience with a Software Framework for
    Parallel Integer Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CHiPPS-Rev.pdf}
    ,
    volume  = {21},
    year = {2009},
    }
  • L. F. Zuluaga, J. Peña, and D. Du, “Third-order extensions of Lo’s semiparametric bound for European call options,” European journal of operational research, vol. 198, iss. 2, p. 557–570, 2009. [Bibtex]
    @article{zuluaga2009third,
    title={Third-order extensions of {L}o's semiparametric bound for {E}uropean call options},
    author={Zuluaga, Luis F and Pe{\~n}a, Javier and Du, Donglei},
    journal={European Journal of Operational Research},
    volume={198},
    number={2},
    pages={557--570},
    year = {2009},
    publisher={Elsevier}
    }

2008

  • [Download PDF] P. Belotti and M. Ç. Pinar, “Optimal oblivious routing under linear and ellipsoidal uncertainty,” Optimization and engineering, vol. 9, iss. 3, pp. 257-271, 2008. [Bibtex]
    @article{BelottiP2008,
    author = {P. Belotti and M.{\c{C}}. Pinar},
    title = {Optimal oblivious routing under linear and ellipsoidal uncertainty},
    journal = {Optimization and Engineering},
    volume = {9},
    number = {3},
    year = {2008},
    pages = {257-271},
    url = {http://www.springerlink.com/content/r48706014637740h/}
    }
  • [Download PDF] G. {Nannicini}, P. {Belotti}, and L. {Liberti}, “A local branching heuristic for MINLPs,” Arxiv e-prints, 2008. [Bibtex]
    @article{NanniciniBL2008,
    author = {{Nannicini}, G. and {Belotti}, P. and {Liberti}, L.},
    title = "{A local branching heuristic for MINLPs}",
    journal = {ArXiv e-prints},
    archivePrefix = "arXiv",
    eprint = {0812.2188},
    year = {2008},
    month = dec,
    url = {http://adsabs.harvard.edu/abs/2008arXiv0812.2188N},
    adsnote = {Provided by the SAO/NASA Astrophysics Data System}
    }
  • [Download PDF] P. Belotti, A. Capone, G. Carello, and F. Malucelli, “Multi-layer mpls network design: the impact of statistical multiplexing,” Computer networks, vol. 52, iss. 6, pp. 1291-1307, 2008. [Bibtex]
    @article{BelottiCCM08,
    author = {P. Belotti and
    A. Capone and
    G. Carello and
    F. Malucelli},
    title = {Multi-layer MPLS network design: the impact of statistical
    multiplexing},
    journal = {Computer Networks},
    volume = {52},
    number = {6},
    year = {2008},
    pages = {1291-1307},
    ee = {http://dx.doi.org/10.1016/j.comnet.2008.01.005},
    url = {http://dx.doi.org/10.1016/j.comnet.2008.01.005},
    bibsource = {DBLP, http://dblp.uni-trier.de}
    }
  • [Download PDF] Z. Akca, R. T. Berger, and T. K. Ralphs, “Modeling and solving location, routing, and scheduling problems,” COR@L Laboratory, Lehigh University 2008. [Bibtex]
    @techreport{akca.berger.ralphs:08,
    author = "Akca, Z and Berger, R T and Ralphs, T K",
    institution = "COR@L Laboratory, Lehigh University",
    title = "Modeling and Solving Location, Routing, and Scheduling Problems",
    url = "http://coral.ie.lehigh.edu/~ted/files/papers/LRSP08.pdf",
    year = {2008},
    }
  • [Download PDF] R. H. Byrd, F. E. Curtis, and J. Nocedal, “An Inexact SQP Method for Equality Constrained Optimization,” SIAM Journal on Optimization, vol. 19, iss. 1, p. 351–369, 2008. [Bibtex]
    @article{ByrdCurtNoce08,
    author = {Byrd, R. H. and Curtis, F. E. and Nocedal, J.},
    title = {{An Inexact SQP Method for Equality Constrained Optimization}},
    journal = {{SIAM Journal on Optimization}},
    volume = {19},
    number = {1},
    pages = {351--369},
    year = {2008},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/ByrdCurtNoce08.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] F. E. Curtis and J. Nocedal, “Flexible Penalty Functions for Nonlinear Constrained Optimization,” IMA Journal of Numerical Analysis, vol. 28, iss. 4, p. 749–769, 2008. [Bibtex]
    @article{CurtNoce08,
    author = {Curtis, F. E. and Nocedal, J.},
    title = {{Flexible Penalty Functions for Nonlinear Constrained Optimization}},
    journal = {{IMA Journal of Numerical Analysis}},
    volume = {28},
    number = {4},
    pages = {749--769},
    year = {2008},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtNoce08.pdf},
    papercite = {3. Journal Articles}
    }
  • O. Günlük and J. Linderoth, “Perspective relaxation of mixed integer nonlinear programs with indicator variables,” in IPCO 2008: The thirteenth conference on integer programming and combinatorial optimization, lecture notes in computer science, 2008, pp. 1-16. [Bibtex]
    @inproceedings{gunluk.linderoth:08,
    author = "O. G{\"u}nl{\"u}k and J. Linderoth",
    title = "Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables",
    booktitle = "{IPCO 2008: The} Thirteenth Conference on Integer
    Programming and Combinatorial Optimization, Lecture Notes in Computer Science",
    editor = "A. Lodi and A. Panconesi and G. Rinaldi",
    volume = 5035,
    pages = "1-16",
    year = {2008},
    }
  • J. Ostrowski, J. Linderoth, F. Rossi, and S. Smriglio, “Constraint orbital branching,” in IPCO 2008: The thirteenth conference on integer programming and combinatorial optimization, 2008, pp. 225-239. [Bibtex]
    @inproceedings{ostrowski.et.al:08,
    author = "J. Ostrowski and J. Linderoth and F. Rossi and S. Smriglio",
    title = "Constraint Orbital Branching",
    booktitle = "{IPCO 2008: The} Thirteenth Conference on Integer
    Programming and Combinatorial Optimization",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    year = {2008},
    volume = 5035,
    pages = "225-239",
    }
  • W. Glankwamdee, J. Linderoth, P. Connard, J. Hutton, and J. Shen, “Combining optimization and simulation for strategic and operational industrial gas production and distribution,” Computers and chemical engineering, vol. 32, p. 2536–2546, 2008. [Bibtex]
    @article{lankwamdee.et.al:08,
    author = "W. Glankwamdee and J. Linderoth and P. Connard and J. Hutton and J. Shen",
    title = "Combining Optimization and Simulation for Strategic and Operational Industrial Gas Production and Distribution",
    journal = "Computers and Chemical Engineering",
    volume = "32",
    pages = "2536--2546",
    year = {2008},
    }
  • A. M. Ross, Y. Rong, and L. V. Snyder, “Supply disruptions with time-dependent parameters,” Computers and operations research, vol. 35, iss. 11, pp. 3504-3529, 2008. [Bibtex]
    @article{RossRongSnyder08,
    author={Ross, A. M. and Y. Rong and L. V. Snyder},
    title={Supply disruptions with time-dependent parameters},
    journal={Computers and Operations Research},
    volume={35},
    number={11},
    pages={3504-3529},
    year = {2008},
    }
  • Y. Rong, L. V. Snyder, and Z. -J. M. Shen, “Bullwhip and reverse bullwhip effects under the rationing game,” 2008. [Bibtex]
    @techreport{RongSnyderShen,
    author={Rong, Y. and L. V. Snyder and Z.-J. M. Shen},
    title={Bullwhip and reverse bullwhip effects under the rationing game},
    institution={},
    year = {2008},
    month={August},
    note={Submitted for publication},
    }
  • L. V. Snyder, Z. -J. M. Shen, and J. L. Sutherland, “Řízení dodavatelských řetězc\ru ve světě ohroženém výpadky / Supply chain management considerations under the threat of disruptions,” Reliant Logistic News (Czech Republic), pp. 16-18, 2008. [Bibtex]
    @article{SnyderShenSutherland08,
    author={Snyder, L. V. and Z.-J. M. Shen and J. L. Sutherland},
    title = {\v{R}\'{i}zen\'{i} dodavatelsk\'{y}ch \v{r}et\v{e}zc\r{u} ve sv\v{e}t\v{e} ohro\v{z}en\'{e}m v\'{y}padky / {Supply} chain management considerations under the threat of disruptions},
    journal={{Reliant Logistic News (Czech Republic)}},
    pages={16-18},
    year = {2008},
    }
  • [DOI] [Download PDF] A. Deza, S. Huang, T. Stephen, and T. Terlaky, “The colourful feasibility problem,” Discrete applied mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. [Bibtex]
    @Article{Deza20082166,
    Title = {The colourful feasibility problem},
    Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
    Journal = {Discrete Applied Mathematics},
    year = {2008},
    Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
    Number = {11},
    Pages = {2166 - 2177},
    Volume = {156},
    Doi = {DOI: 10.1016/j.dam.2008.01.016},
    ISSN = {0166-218X},
    Keywords = {Colourful linear programming},
    Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • [Download PDF] A. Deza, E. Nematollahi, and T. Terlaky, “How good are interior point methods? klee-minty cubes tighten iteration-complexity bounds,” Mathematical programming, vol. 113, pp. 1-14, 2008. [Bibtex]
    @Article{Deza2008,
    Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
    Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
    Journal = {Mathematical Programming},
    year = {2008},
    Note = {10.1007/s10107-006-0044-x},
    Pages = {1-14},
    Volume = {113},
    Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
    ISSN = {0025-5610},
    Issue = {1},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • [DOI] [Download PDF] A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, “Diameter and curvature: intriguing analogies,” Electronic notes in discrete mathematics, vol. 31, pp. 221-225, 2008. [Bibtex]
    @Article{Deza2008221,
    Title = {Diameter and Curvature: Intriguing Analogies},
    Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
    Journal = {Electronic Notes in Discrete Mathematics},
    year = {2008},
    Note = {The International Conference on Topological and Geometric Graph Theory},
    Pages = {221 - 225},
    Volume = {31},
    Doi = {DOI: 10.1016/j.endm.2008.06.044},
    ISSN = {1571-0653},
    Keywords = {Continuous d-step and Hirsch conjectures},
    Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • [DOI] [Download PDF] A. Deza, T. Terlaky, and Y. Zinchenko, “Polytopes and arrangements: diameter and curvature,” Operations research letters, vol. 36, iss. 2, pp. 215-222, 2008. [Bibtex]
    @Article{Deza2008215,
    Title = {Polytopes and arrangements: Diameter and curvature},
    Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
    Journal = {Operations Research Letters},
    year = {2008},
    Number = {2},
    Pages = {215 - 222},
    Volume = {36},
    Doi = {DOI: 10.1016/j.orl.2007.06.007},
    ISSN = {0167-6377},
    Keywords = {Polytopes},
    Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • [Download PDF] A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, “Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization,” Central european journal of operations research, vol. 16, pp. 215-238, 2008. [Bibtex]
    @Article{Ghaffari-Hadigheh2008,
    Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
    Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
    Journal = {Central European Journal of Operations Research},
    year = {2008},
    Note = {10.1007/s10100-007-0054-7},
    Pages = {215-238},
    Volume = {16},
    Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
    ISSN = {1435-246X},
    Issue = {2},
    Keyword = {Business and Economics},
    Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
    Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • [Download PDF] C. Kumar Anand, T. Ren, and T. Terlaky, “Optimizing teardrop, an mri sampling trajectory,” Optimization methods software, vol. 23, p. 575–592, 2008. [Bibtex]
    @Article{KumarAnand2008,
    Title = {Optimizing Teardrop, an MRI sampling trajectory},
    Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
    Journal = {Optimization Methods Software},
    year = {2008},
    Month = {August},
    Pages = {575--592},
    Volume = {23},
    Acmid = {1451568},
    Address = {Bristol, PA, USA},
    ISSN = {1055-6788},
    Issue = {4},
    Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
    Numpages = {18},
    Publisher = {Taylor \& Francis, Inc.},
    Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • [Download PDF] E. Nematollahi and T. Terlaky, “A simpler and tighter redundant klee–minty construction,” Optimization letters, vol. 2, pp. 403-414, 2008. [Bibtex]
    @Article{Nematollahi2008,
    Title = {A simpler and tighter redundant Klee–Minty construction},
    Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
    Journal = {Optimization Letters},
    year = {2008},
    Note = {10.1007/s11590-007-0068-z},
    Pages = {403-414},
    Volume = {2},
    Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
    ISSN = {1862-4472},
    Issue = {3},
    Keyword = {Business and Economics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • [DOI] [Download PDF] E. Nematollahi and T. Terlaky, “A redundant klee-minty construction with all the redundant constraints touching the feasible region,” Operations research letters, vol. 36, iss. 4, pp. 414-418, 2008. [Bibtex]
    @Article{Nematollahi2008414,
    Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
    Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
    Journal = {Operations Research Letters},
    year = {2008},
    Number = {4},
    Pages = {414 - 418},
    Volume = {36},
    Doi = {DOI: 10.1016/j.orl.2008.02.004},
    ISSN = {0167-6377},
    Keywords = {Linear optimization},
    Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • [Download PDF] M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, “Packing trees in communication networks,” Journal of combinatorial optimization, vol. 16, pp. 402-423, 2008. [Bibtex]
    @Article{Saad2008,
    Title = {Packing trees in communication networks},
    Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
    Journal = {Journal of Combinatorial Optimization},
    year = {2008},
    Note = {10.1007/s10878-008-9150-4},
    Pages = {402-423},
    Volume = {16},
    Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
    ISSN = {1382-6905},
    Issue = {4},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • [DOI] [Download PDF] M. Salahi, M. R. Peyghami, and T. Terlaky, “New complexity analysis of iipms for linear optimization based on a specific self-regular function,” European journal of operational research, vol. 186, iss. 2, pp. 466-485, 2008. [Bibtex]
    @Article{Salahi2008466,
    Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
    Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
    Journal = {European Journal of Operational Research},
    year = {2008},
    Number = {2},
    Pages = {466 - 485},
    Volume = {186},
    Doi = {DOI: 10.1016/j.ejor.2007.02.008},
    ISSN = {0377-2217},
    Keywords = {Linear optimization},
    Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • [DOI] [Download PDF] T. Terlaky, A. Vannelli, and H. Zhang, “On routing in vlsi design and communication networks,” Discrete appl. math., vol. 156, p. 2178–2194, 2008. [Bibtex]
    @Article{Terlaky2008,
    Title = {On routing in VLSI design and communication networks},
    Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
    Journal = {Discrete Appl. Math.},
    year = {2008},
    Month = {June},
    Pages = {2178--2194},
    Volume = {156},
    Acmid = {1393780},
    Address = {Amsterdam, The Netherlands, The Netherlands},
    Doi = {10.1016/j.dam.2008.01.014},
    ISSN = {0166-218X},
    Issue = {11},
    Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
    Numpages = {17},
    Publisher = {Elsevier Science Publishers B. V.},
    Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • [Download PDF] T. Terlaky and J. Zhu, “Comments on dual methods for nonconvex spectrum optimization of multicarrier systems”,” Optimization letters, vol. 2, pp. 497-503, 2008. [Bibtex]
    @Article{Terlaky2008a,
    Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
    Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
    Journal = {Optimization Letters},
    year = {2008},
    Note = {10.1007/s11590-008-0076-7},
    Pages = {497-503},
    Volume = {2},
    Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
    ISSN = {1862-4472},
    Issue = {4},
    Keyword = {Business and Economics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • [Download PDF] Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, “Controlling the dose distribution with geud-type constraints within the convex radiotherapy optimization framework,” Physics in medicine and biology, vol. 53, iss. 12, p. 3231, 2008. [Bibtex]
    @Article{Zinchenko2008,
    Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
    Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
    Journal = {Physics in Medicine and Biology},
    year = {2008},
    Number = {12},
    Pages = {3231},
    Volume = {53},
    Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
    Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }
  • [Download 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. [Bibtex]
    @TechReport{ GuzRal08,
    author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{The Value Function of a Mixed-integer Linear Program with
    a Single Constraint}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ValueFunction.pdf}
    ,
    year = {2008},
    }
  • [Download PDF] Z. Akca, R. T. Berger, and T. K. Ralphs, “Modeling and Solving Location, Routing, and Scheduling Problems,” COR@L Laboratory Report 08T-009, Lehigh University 2008. [Bibtex]
    @TechReport{ AkcBerRal08,
    author  = {Akca, Z. and Berger, R.T. and Ralphs, T.K.},
    institution  = {COR@L Laboratory Report 08T-009, Lehigh University},
    title = {{Modeling and Solving Location, Routing, and Scheduling
    Problems}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/LRSP08.pdf},
    year = {2008},
    }
  • [Download PDF] T. K. Ralphs, “SYMPHONY Version 5.1 User’s Manual,” COR@L Laboratory, Lehigh University 2008. [Bibtex]
    @TechReport{ Ral08,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.1 User's Manual}},
    url = {http://www.coin-or.org/SYMPHONY/SYMPHONY-5.1.8-Manual.pdf}
    ,
    year = {2008},
    }
  • J. F. Pena, J. C. Vera, and L. F. Zuluaga, “Exploiting equalities in polynomial programming,” Operations research letters, vol. 36, iss. 2, p. 223–228, 2008. [Bibtex]
    @article{pena2008exploiting,
    title={Exploiting equalities in polynomial programming},
    author={Pena, Javier F and Vera, Juan C and Zuluaga, Luis F},
    journal={Operations Research Letters},
    volume={36},
    number={2},
    pages={223--228},
    year = {2008},
    publisher={Elsevier}
    }
  • C. Jabbour, J. F. Peña, J. C. Vera, and L. F. Zuluaga, “An estimation-free, robust conditional Value-at-Risk portfolio allocation model,” The journal of risk, vol. 11, iss. 1, p. 57, 2008. [Bibtex]
    @article{jabbour2008estimation,
    title={An estimation-free, robust conditional {V}alue-at-{R}isk portfolio allocation model},
    author={Jabbour, Carlos and Pe{\~n}a, Javier F and Vera, Juan C and Zuluaga, Luis F},
    journal={The Journal of Risk},
    volume={11},
    number={1},
    pages={57},
    year = {2008},
    publisher={Incisive Media Plc}
    }

2007

  • [Download PDF] P. Belotti, M. Labbé, F. Maffioli, and M. M. Ndiaye, “A branch-and-cut method for the obnoxious p-median problem,” 4or, vol. 5, iss. 4, pp. 299-314, 2007. [Bibtex]
    @article{BelottiLMN07,
    author = {P. Belotti and
    M. Labb{\'e} and
    F. Maffioli and
    M. M. Ndiaye},
    title = {A branch-and-cut method for the obnoxious p-median
    problem},
    journal = {4OR},
    volume = {5},
    number = {4},
    year = {2007},
    pages = {299-314},
    ee = {http://dx.doi.org/10.1007/s10288-006-0023-3},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://dx.doi.org/10.1007/s10288-006-0023-3}
    }
  • [Download PDF] P. Belotti, F. Malucelli, and L. Brunetta, “Multicommodity network design with discrete node costs,” Networks, vol. 49, iss. 1, pp. 90-99, 2007. [Bibtex]
    @article{BelottiMB07,
    author = {P. Belotti and
    F. Malucelli and
    L. Brunetta},
    title = {Multicommodity network design with discrete node costs},
    journal = {Networks},
    volume = {49},
    number = {1},
    year = {2007},
    pages = {90-99},
    ee = {http://dx.doi.org/10.1002/net.20144},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://www3.interscience.wiley.com/journal/113392676/abstract?CRETRY=1&SRETRY=0}
    }
  • [Download PDF] S. Kucherenko, P. Belotti, L. Liberti, and N. Maculan, “New formulations for the kissing number problem,” Discrete applied mathematics, vol. 155, iss. 14, pp. 1837-1841, 2007. [Bibtex]
    @article{KucherenkoBLM07,
    author = {S. Kucherenko and
    P. Belotti and
    L. Liberti and
    N. Maculan},
    title = {New formulations for the Kissing Number Problem},
    journal = {Discrete Applied Mathematics},
    volume = {155},
    number = {14},
    year = {2007},
    pages = {1837-1841},
    ee = {http://dx.doi.org/10.1016/j.dam.2006.05.012},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://dx.doi.org/10.1016/j.dam.2006.05.012}
    }
  • [Download PDF] A. Altin, E. Amaldi, P. Belotti, and M. Ç. Pinar, “Provisioning virtual private networks under traffic uncertainty,” Networks, vol. 49, iss. 1, pp. 100-115, 2007. [Bibtex]
    @article{AltinABP07,
    author = {A. Altin and
    E. Amaldi and
    P. Belotti and
    M. \c{C}. Pinar},
    title = {Provisioning virtual private networks under traffic uncertainty},
    journal = {Networks},
    volume = {49},
    number = {1},
    year = {2007},
    pages = {100-115},
    ee = {http://dx.doi.org/10.1002/net.20145},
    url = {http://dx.doi.org/10.1002/net.20145},
    bibsource = {DBLP, http://dblp.uni-trier.de}
    }
  • P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, and A. Totaro, “Design of multi-layer networks with traffic grooming and statistical multiplexing,” in The international network optimization conference (inoc 2007), 2007. [Bibtex]
    @inproceedings{BelottiEtAlInoc2007,
    title={Design of Multi-layer networks with traffic grooming and statistical multiplexing},
    author={Belotti, P. and Capone, A. and Carello, G. and Malucelli, F. and Senaldi, F. and Totaro, A.},
    booktitle={the International Network Optimization Conference (INOC 2007)},
    year = {2007},
    }
  • [Download PDF] R. T. Berger, C. R. Coullard, and M. S. Daskin, “Location-routing problems with distance constraints,” Transportation science, vol. 41, iss. 1, p. 29–43, 2007. [Bibtex]
    @article{berger.coullard.daskin:07,
    author = "Berger, R T and Coullard, C R and Daskin, M S",
    title = "Location-Routing Problems with Distance Constraints",
    journal = "Transportation Science",
    volume = "41",
    number = "1",
    pages = "29--43",
    year = {2007},
    url = "http://coral.ie.lehigh.edu/pubs/files/rtb3_TransSci.pdf"
    }
  • [Download PDF] F. E. Curtis, “Inexact Sequential Quadratic Programming Methods for Large-Scale Nonlinear Optimization,” PhD Thesis, 2007. [Bibtex]
    @phdthesis{Curt07,
    author = {Curtis, F. E.},
    title = {{Inexact Sequential Quadratic Programming Methods for Large-Scale Nonlinear Optimization}},
    school = {Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL, USA},
    year = {2007},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/dissertations/Curt07.pdf},
    papercite = {5. Theses}
    }
  • [Download PDF] F. E. Curtis and J. Nocedal, “Steplength Selection in Interior-Point Methods for Quadratic Programming,” Applied Mathematics Letters, vol. 20, iss. 5, p. 516–523, 2007. [Bibtex]
    @article{CurtNoce07,
    author = {Curtis, F. E. and Nocedal, J.},
    title = {{Steplength Selection in Interior-Point Methods for Quadratic Programming}},
    journal = {{Applied Mathematics Letters}},
    volume = {20},
    number = {5},
    pages = {516--523},
    year = {2007},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtNoce07.pdf},
    papercite = {3. Journal Articles}
    }
  • J. Ostrowski, J. Linderoth, F. Rossi, and S. Smriglio, “Orbital branching,” in IPCO 2007: The twelfth conference on integer programming and combinatorial optimization, 2007, pp. 104-118. [Bibtex]
    @inproceedings{ostrowski.et.al:07,
    author = "J. Ostrowski and J. Linderoth and F. Rossi and S. Smriglio",
    title = "Orbital Branching",
    booktitle = "{IPCO 2007: The} Twelfth Conference on Integer
    Programming and Combinatorial Optimization",
    year = {2007},
    editor = "M. Fischetti and D. Williamson",
    publisher = "Springer",
    pages = "104-118"
    }
  • L. V. Snyder, M. S. Daskin, and C. P. Teo, “The stochastic location model with risk pooling,” European journal of operational research, vol. 179, iss. 3, pp. 1221-1238, 2007. [Bibtex]
    @article{SnyderDaskinTeo07,
    author={Snyder, L. V. and M. S. Daskin and C. P. Teo},
    title={The stochastic location model with risk pooling},
    journal={European Journal of Operational Research},
    volume={179},
    number={3},
    pages={1221-1238},
    year = {2007},
    }
  • J. H. Hartman, S. C. Liedka, and L. V. Snyder, “The impact of US tax depreciation law on asset location and ownership decisions,” Computers and operations research, vol. 34, iss. 12, pp. 3560-3568, 2007. [Bibtex]
    @article{HartmanLiedkaSnyder07,
    author={Hartman, J. H. and S. C. Liedka and L. V. Snyder},
    title={The impact of {US} tax depreciation law on asset location and ownership decisions},
    journal={Computers and Operations Research},
    volume={34},
    number={12},
    pages={3560-3568},
    year = {2007},
    }
  • L. V. Snyder and Z. -J. M. Shen, “Supply chain management under the threat of disruptions,” in Frontiers of engineering: reports on leading-edge engineering from the 2006 symposium, Washington, DC: National Academies Press, 2007, pp. 139-147. [Bibtex]
    @incollection{SnyderShen07,
    author={Snyder, L. V. and Z.-J. M. Shen},
    title={Supply chain management under the threat of disruptions},
    booktitle={Frontiers of Engineering: Reports on Leading-Edge Engineering from the 2006 Symposium},
    publisher={Washington, DC: National Academies Press},
    pages={139-147},
    year = {2007},
    }
  • L. V. Snyder and M. S. Daskin, “Models for reliable supply chain network design,” in Critical infrastructure: reliability and vulnerability, A. T. Murray and T. H. Grubesic, Eds., Berlin: Springer-Verlag, 2007, pp. 257-289. [Bibtex]
    @incollection{SnyderDaskin07,
    author={Snyder, L. V. and M. S. Daskin},
    title={Models for reliable supply chain network design},
    booktitle={Critical Infrastructure: Reliability and Vulnerability},
    editor={A. T. Murray and T. H. Grubesic },
    publisher={Berlin: Springer-Verlag},
    chapter={13},
    pages={257-289},
    year = {2007},
    }
  • B. T. Tomlin and L. V. Snyder, “On the value of a threat advisory system for managing supply chain disruptions,” 2007. [Bibtex]
    @techreport{TomlinSnyder,
    author={Tomlin, B.T. and L. V. Snyder},
    title={On the value of a threat advisory system for managing supply chain disruptions},
    institution={},
    year = {2007},
    month={April},
    note={Submitted for publication},
    }
  • [Download PDF] C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, “Magnetic resonance tissue quantification using optimal bssfp pulse-sequence design,” Optimization and engineering, vol. 8, pp. 215-238, 2007. [Bibtex]
    @Article{Anand2007,
    Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
    Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
    Journal = {Optimization and Engineering},
    year = {2007},
    Note = {10.1007/s11081-007-9009-z},
    Pages = {215-238},
    Volume = {8},
    Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
    ISSN = {1389-4420},
    Issue = {2},
    Keyword = {Engineering},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • [Download PDF] A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, “Active constraint set invariancy sensitivity analysis in linear optimization,” Journal of optimization theory and applications, vol. 133, pp. 303-315, 2007. [Bibtex]
    @Article{GhaffariHadigheh2007,
    Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
    Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {2007},
    Note = {10.1007/s10957-007-9201-5},
    Pages = {303-315},
    Volume = {133},
    Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
    ISSN = {0022-3239},
    Issue = {3},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • [Download PDF] A. Hadigheh, O. Romanko, and T. Terlaky, “Sensitivity analysis in convex quadratic optimization: simultaneous perturbation of the objective and right-hand-side vectors,” Algorithmic operations research, vol. 2, iss. 2, p. 94–111, 2007. [Bibtex]
    @Article{AOR4624,
    Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
    Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
    Journal = {Algorithmic Operations Research},
    year = {2007},
    Number = {2},
    Pages = {94--111},
    Volume = {2},
    Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
    Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • [DOI] [Download PDF] I. Pólik and T. Terlaky, “A survey of the s-lemma,” Siam rev., vol. 49, p. 371–418, 2007. [Bibtex]
    @Article{Polik2007,
    Title = {A Survey of the S-Lemma},
    Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
    Journal = {SIAM Rev.},
    year = {2007},
    Month = {July},
    Pages = {371--418},
    Volume = {49},
    Acmid = {1655210},
    Address = {Philadelphia, PA, USA},
    Doi = {10.1137/S003614450444614X},
    ISSN = {0036-1445},
    Issue = {3},
    Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
    Numpages = {48},
    Publisher = {Society for Industrial and Applied Mathematics},
    Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • [DOI] [Download PDF] M. Salahi, J. Peng, and T. Terlaky, “On mehrotra-type predictor-corrector algorithms,” Siam j. on optimization, vol. 18, p. 1377–1397, 2007. [Bibtex]
    @Article{Salahi2007,
    Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
    Author = {Salahi, M. and Peng, J. and Terlaky, T.},
    Journal = {SIAM J. on Optimization},
    year = {2007},
    Month = {December},
    Pages = {1377--1397},
    Volume = {18},
    Acmid = {1350573},
    Address = {Philadelphia, PA, USA},
    Doi = {10.1137/050628787},
    ISSN = {1052-6234},
    Issue = {4},
    Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
    Numpages = {21},
    Publisher = {Society for Industrial and Applied Mathematics},
    Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • [DOI] [Download PDF] M. Salahi and T. Terlaky, “Postponing the choice of the barrier parameter in mehrotra-type predictor-corrector algorithms,” European journal of operational research, vol. 182, iss. 2, pp. 502-513, 2007. [Bibtex]
    @Article{Salahi2007502,
    Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
    Author = {Maziar Salahi and Tamás Terlaky},
    Journal = {European Journal of Operational Research},
    year = {2007},
    Number = {2},
    Pages = {502 - 513},
    Volume = {182},
    Doi = {DOI: 10.1016/j.ejor.2006.08.044},
    ISSN = {0377-2217},
    Keywords = {Linear optimization},
    Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • [Download PDF] M. Salahi and T. Terlaky, “Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization,” Journal of optimization theory and applications, vol. 132, pp. 143-160, 2007. [Bibtex]
    @Article{Salahi2007a,
    Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
    Author = {Salahi, M. and Terlaky, T.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {2007},
    Note = {10.1007/s10957-006-9095-7},
    Pages = {143-160},
    Volume = {132},
    Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
    ISSN = {0022-3239},
    Issue = {1},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • [Download PDF] M. Güzelsoy and T. K. Ralphs, “Duality for Mixed-Integer Linear Programs,” International journal of operations research, vol. 4, p. 118–137, 2007. [Bibtex]
    @Article{ GuzRal07,
    author  = {G{\"u}zelsoy, M. and Ralphs, T.K.},
    journal  = {International Journal of Operations Research},
    pages = {118--137},
    title = {{Duality for Mixed-Integer Linear Programs}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILPD06.pdf},
    volume  = {4},
    year = {2007},
    }
  • [Download PDF] Y. Xu, T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “Computational Experience with a Framework for Parallel Integer Programming,” COR@L Laboratory Report , Lehigh University 2007. [Bibtex]
    @TechReport{ XuRalLadSal07,
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
    M.J.},
    institution  = {COR@L Laboratory Report , Lehigh University},
    title = {{Computational Experience with a Framework for Parallel
    Integer Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CHiPPS.pdf},
    year = {2007},
    }
  • [Download PDF] O. Osaltyn, B. Hunsaker, and T. K. Ralphs, “Visualizing Branch-and-Bound Algorithms,” COR@L Laboratory, Lehigh Univesity 2007. [Bibtex]
    @TechReport{ OsaHunRal07,
    software  = {http://github.com/coin-or/GrUMPy},
    author  = {Osaltyn, O. and Hunsaker, B. and Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh Univesity},
    title = {{Visualizing Branch-and-Bound Algorithms}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BBVis.pdf},
    year = {2007},
    }
  • A. Pajunas, E. J. Matto, M. Trick, and L. F. Zuluaga, “Optimizing highway transportation at the united states postal service,” Interfaces, vol. 37, iss. 6, p. 515–525, 2007. [Bibtex]
    @article{pajunas2007optimizing,
    title={Optimizing highway transportation at the United States postal service},
    author={Pajunas, Anthony and Matto, Edward J and Trick, Michael and Zuluaga, Luis F},
    journal={Interfaces},
    volume={37},
    number={6},
    pages={515--525},
    year = {2007},
    publisher={INFORMS}
    }
  • J. Pena, J. Vera, and L. F. Zuluaga, “Computing the stability number of a graph via linear and semidefinite programming,” Siam journal on optimization, vol. 18, iss. 1, p. 87–105, 2007. [Bibtex]
    @article{pena2007computing,
    title={Computing the stability number of a graph via linear and semidefinite programming},
    author={Pena, Javier and Vera, Juan and Zuluaga, Luis F},
    journal={SIAM Journal on Optimization},
    volume={18},
    number={1},
    pages={87--105},
    year = {2007},
    publisher={SIAM}
    }
  • Q. Han, D. Du, J. Vera, and L. Zululaga, “Improved bounds for the symmetric rendezvous problem on the line,” in Acm-siam symposium on discrete algorithms (soda), 2007, p. 69–78. [Bibtex]
    @inproceedings{Du2007improved,
    title={Improved bounds for the symmetric rendezvous problem on the line},
    author={Han, Q and Du, D and Vera, JC and Zululaga, LF},
    booktitle = {ACM-SIAM Symposium on Discrete Algorithms (SODA)},
    year = {2007},
    pages = {69--78}
    }

2006

  • [Download PDF] E. Amaldi, P. Belotti, A. Capone, and F. Malucelli, “Optimizing base station location and configuration in umts networks,” Annals of operations research, vol. 146, iss. 1, pp. 135-151, 2006. [Bibtex]
    @article{AmaldiBCM06,
    author = {E. Amaldi and
    P. Belotti and
    A. Capone and
    F. Malucelli},
    title = {Optimizing base station location and configuration in UMTS
    networks},
    journal = {Annals of Operations Research},
    volume = {146},
    number = {1},
    year = {2006},
    pages = {135-151},
    ee = {http://dx.doi.org/10.1007/s10479-006-0046-3},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://www.springerlink.com/content/x434jp4013766527/}
    }
  • P. Belotti, A. M. C. A. Koster, and S. Orlowski, “A cut&branch&price approach to two-layer network design,” in The 8th INFORMS telecommunications conference, Dallas {TX}, 2006. [Bibtex]
    @inproceedings{BelottiKO2006,
    author = {P. Belotti and A.M.C.A. Koster and S. Orlowski},
    title = {A cut\&branch\&price approach to two-layer network design},
    booktitle = {The 8th {INFORMS} Telecommunications Conference},
    address = {Dallas {TX}},
    year = {2006},
    }
  • [Download PDF] F. E. Curtis and R. Kincaid, “Determinant Optimization on Binary Matrices,” American Journal of Mathematical and Management Sciences, vol. 26, iss. 1–2, p. 33–70, 2006. [Bibtex]
    @article{CurtKinc06,
    author = {Curtis, F. E. and Kincaid, R.},
    title = {{Determinant Optimization on Binary Matrices}},
    journal = {{American Journal of Mathematical and Management Sciences}},
    volume = {26},
    number = {1--2},
    pages = {33--70},
    year = {2006},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtKinc06.pdf},
    papercite = {3. Journal Articles}
    }
  • [Download PDF] W. Glankwamdee and J. T. Linderoth, “MW: A software framework for combinatorial optimization on computational grids,” in Parallel combinatorial optimization, E. Talbi, Ed., Hoboken, New Jersey: Wiley-Interscience, 2006, pp. 239-262. [Bibtex]
    @incollection{glankwamdee.linderoth:06,
    AUTHOR = "W. Glankwamdee and J. T. Linderoth",
    TITLE = "{MW: A} Software Framework for Combinatorial Optimization on
    Computational Grids",
    BOOKTITLE = "Parallel Combinatorial Optimization",
    PUBLISHER = "Wiley-Interscience",
    ADDRESS = "Hoboken, New Jersey",
    year = {2006},
    EDITOR = "E. Talbi",
    PAGES = "239-262",
    URL = "http://coral.ie.lehigh.edu/pubs/files/wasu_mwknapsack.pdf"
    }
  • [Download PDF] J. T. Linderoth, A. Shapiro, and S. J. Wright, “The empirical behavior of sampling methods for stochastic programming,” Annals of operations research, vol. 142, pp. 219-245, 2006. [Bibtex]
    @article{linderoth.shapiro.wright:06,
    AUTHOR = "J. T. Linderoth and A. Shapiro and S. J. Wright",
    TITLE = "The Empirical Behavior of Sampling Methods for Stochastic Programming",
    JOURNAL = "Annals of Operations Research",
    year = {2006},
    VOLUME = 142,
    PAGES = "219-245",
    url = "http://coral.ie.lehigh.edu/pubs/files/jtl3_empirical.pdf"
    }
  • W. Glankwamdee and J. T. Linderoth, “Lookahead branching for mixed integer programming,” Department of Industrial and Systems Engineering, Lehigh University, Technical Report 06T-004, 2006. [Bibtex]
    @techreport{glankwamdee.linderoth:06-1,
    author = "W. Glankwamdee and J. T. Linderoth",
    title = "Lookahead Branching for Mixed Integer Programming",
    institution = "Department of Industrial and Systems Engineering, Lehigh University",
    type = "Technical Report",
    number = "06T-004",
    year = {2006},
    }
  • C. Novoa, R. Berger, J. T. Linderoth, and R. Storer, “A set-partitioning-based model and solution procedures for the stochastic vehicle routing problem,” Department of Industrial and Systems Engineering, Lehigh University, Technical Report 06T-008, 2006. [Bibtex]
    @techreport{novoa.et.al:06,
    author = "C. Novoa and R. Berger and J. T. Linderoth and R. Storer",
    title = "A Set-Partitioning-Based Model and Solution Procedures for the Stochastic Vehicle Routing Problem",
    institution = "Department of Industrial and Systems Engineering, Lehigh University",
    type = "Technical Report",
    number = "06T-008",
    year = {2006},
    }
  • L. V. Snyder, “Facility location under uncertainty: A review,” Iie transactions, vol. 38, iss. 7, pp. 537-554, 2006. [Bibtex]
    @article{Snyder06,
    author={Snyder, L. V. },
    title={{Facility location under uncertainty: A review}},
    journal={IIE Transactions},
    volume={38},
    number={7},
    pages={537-554},
    year = {2006},
    }
  • L. V. Snyder and M. S. Daskin, “Stochastic $p$-robust location problems,” Iie transactions, vol. 38, iss. 11, pp. 971-985, 2006. [Bibtex]
    @article{SnyderDaskinIIET06,
    author={Snyder, L. V. and M. S. Daskin},
    title={Stochastic $p$-robust location problems},
    journal={IIE Transactions},
    volume={38},
    number={11},
    pages={971-985},
    year = {2006},
    }
  • L. V. Snyder and M. S. Daskin, “A random-key genetic algorithm for the generalized traveling salesman problem,” European journal of operational research, vol. 174, iss. 1, pp. 38-53, 2006. [Bibtex]
    @article{SnyderDaskinEJOR06,
    author={Snyder, L. V. and M. S. Daskin},
    title={A random-key genetic algorithm for the generalized traveling salesman problem},
    journal={European Journal of Operational Research},
    volume={174},
    number={1},
    pages={38-53},
    year = {2006},
    }
  • L. V. Snyder and Z. -J. M. Shen, “Supply chain management under the threat of disruptions,” The Bridge (National Academy of Engineering), vol. 36, iss. 4, pp. 39-45, 2006. [Bibtex]
    @article{SnyderShen06,
    author={Snyder, L. V. and Z.-J. M. Shen},
    title={Supply chain management under the threat of disruptions},
    journal={{The Bridge (National Academy of Engineering)}},
    volume={36},
    number={4},
    pages={39-45},
    year = {2006},
    }
  • L. V. Snyder, M. P. Scaparra, M. S. Daskin, and R. L. Church, “Planning for disruptions in supply chain networks,” in Tutorials in operations research, N. B. Johnson M. P. and N. Secomandi, Eds., Baltimore: INFORMS, 2006, pp. 234-257. [Bibtex]
    @incollection{SnyderScaparraDaskinChurch06,
    author={Snyder, L. V. and Scaparra, M. P. and Daskin, M. S. and R. L. Church},
    title={Planning for disruptions in supply chain networks},
    booktitle={TutORials in Operations Research},
    editor={Johnson, M. P., B. Norman, and N. Secomandi},
    publisher={Baltimore: INFORMS},
    chapter={9},
    pages={234-257},
    year = {2006},
    }
  • L. V. Snyder and Z. -J. M. Shen, “Supply and demand uncertainty in multi-echelon supply chains,” 2006. [Bibtex]
    @techreport{SnyderShen,
    author={L. V. Snyder and Z.-J. M. Shen},
    title={Supply and demand uncertainty in multi-echelon supply chains},
    institution={},
    year = {2006},
    month={September},
    note={Submitted for publication},
    }
  • L. V. {Snyder, Z. -J. M. Shen, and J. L. Sutherland}, “Supply chain management considerations under the threat of disruptions,” Lehigh Unviversity 2006. [Bibtex]
    @techreport{SnyderShenSutherland06,
    author={{Snyder, L. V. and Z.-J. M. Shen and J. L. Sutherland}},
    title={{Supply chain management considerations under the threat of disruptions}},
    institution={Lehigh Unviversity},
    year = {2006},
    note={{Center for Value Chain Research white paper \#0603}},
    }
  • [Download PDF] A. Deza, S. Huang, T. Stephen, and T. Terlaky, “Colourful simplicial depth,” Discrete & computational geometry, vol. 35, pp. 597-615, 2006. [Bibtex]
    @Article{Deza2006a,
    Title = {Colourful Simplicial Depth},
    Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
    Journal = {Discrete \& Computational Geometry},
    year = {2006},
    Note = {10.1007/s00454-006-1233-3},
    Pages = {597-615},
    Volume = {35},
    Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
    ISSN = {0179-5376},
    Issue = {4},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer New York},
    Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • [Download PDF] A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, “The central path visits all the vertices of the klee–minty cube,” Optimization methods and software, vol. 21, iss. 5, p. 851– 865, 2006. [Bibtex]
    @Article{Deza2006,
    Title = {The central path visits all the vertices of the Klee–Minty cube},
    Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
    Journal = {Optimization Methods and Software},
    year = {2006},
    Number = {5},
    Pages = {851-- 865},
    Volume = {21},
    Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, “Sensitivity analysis in linear and convex quadratic optimization: invariant active constraint set and invariant set intervals,” Infor: information systems and operational research, vol. 44, iss. 2, pp. 129-155, 2006. [Bibtex]
    @Article{Hadigheh2006,
    Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
    Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
    Journal = {INFOR: Information Systems and Operational Research},
    year = {2006},
    Number = {2},
    Pages = {129-155},
    Volume = {44}
    }
  • [DOI] [Download PDF] A. G. Hadigheh and T. Terlaky, “Sensitivity analysis in linear optimization: invariant support set intervals,” European journal of operational research, vol. 169, iss. 3, pp. 1158-1175, 2006. [Bibtex]
    @Article{Hadigheh20061158,
    Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
    Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
    Journal = {European Journal of Operational Research},
    year = {2006},
    Number = {3},
    Pages = {1158 - 1175},
    Volume = {169},
    Doi = {DOI: 10.1016/j.ejor.2004.09.058},
    ISSN = {0377-2217},
    Keywords = {Parametric optimization},
    Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • [Download PDF] G. A. Hadigheh and T. Terlaky, “Generalized support set invariancy sensitivity analysis in linear optimization,” Journal of industrial and management optimization, vol. 2, iss. 1, p. 1–18, 2006. [Bibtex]
    @Article{Hadigheh2006a,
    Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
    Author = {A. Ghaffari Hadigheh and T. Terlaky},
    Journal = {Journal of Industrial and Management Optimization},
    year = {2006},
    Number = {1},
    Pages = {1--18},
    Volume = {2},
    Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior point methods for linear optimization, Heidelberg/Boston: Springer Science, 2006. [Bibtex]
    @Book{Roos2006,
    Title = {Interior Point Methods for Linear Optimization},
    Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Publisher = {Springer Science},
    year = {2006},
    Address = {Heidelberg/Boston},
    Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • [DOI] [Download PDF] M. Salahi, T. Terlaky, and G. Zhang, “The complexity of self-regular proximity based infeasible ipms,” Comput. optim. appl., vol. 33, p. 157–185, 2006. [Bibtex]
    @Article{Salahi2006,
    Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
    Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
    Journal = {Comput. Optim. Appl.},
    year = {2006},
    Month = {March},
    Pages = {157--185},
    Volume = {33},
    Acmid = {1121222},
    Address = {Norwell, MA, USA},
    Doi = {10.1007/s10589-005-3064-1},
    ISSN = {0926-6003},
    Issue = {2-3},
    Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
    Numpages = {29},
    Publisher = {Kluwer Academic Publishers},
    Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, “A nearly analytical discrete method for wave-field simulations in 2d porous media,” Communications in computational physics, vol. 1, iss. 3, pp. 528-547, 2006. [Bibtex]
    @Article{Yang2006,
    Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
    Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
    Journal = {Communications in Computational Physics},
    year = {2006},
    Number = {3},
    Pages = {528-547},
    Volume = {1}
    }
  • [DOI] [Download PDF] D. Yang, J. Peng, M. Lu, and T. Terlaky, “Optimal nearly analytic discrete approximation to the scalar wave equation,” Bulletin of the seismological society of america, vol. 96, iss. 3, pp. 1114-1130, 2006. [Bibtex]
    @Article{DinghuiYang06012006,
    Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
    Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
    Journal = {Bulletin of the Seismological Society of America},
    year = {2006},
    Number = {3},
    Pages = {1114-1130},
    Volume = {96},
    Doi = {10.1785/0120050080},
    Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
    Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • [DOI] [Download PDF] T. K. Ralphs and M. V. Galati, “Decomposition and Dynamic Cut Generation in Integer Programming,” Mathematical programming, vol. 106, p. 261–285, 2006. [Bibtex]
    @Article{ RalGal06,
    software  = {https://projects.coin-or.org/},
    author  = {Ralphs, T.K. and Galati, M.V.},
    doi = {10.1007/s10107-005-0606-3},
    journal  = {Mathematical Programming},
    pages = {261--285},
    title = {{Decomposition and Dynamic Cut Generation in Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/DECOMP.pdf},
    volume  = {106},
    year = {2006},
    }
  • [Download PDF] 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. [Bibtex]
    @InProceedings{ RalGuz06,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
    booktitle  = {The Proceedings of the 2006 NSF Design, Service, and
    Manufacturing Grantees and Research Conference},
    title = {{Duality and Warm Starting in Integer Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/DMII06.pdf},
    year = {2006},
    }
  • [Download PDF] T. K. Ralphs, “Parallel Branch and Cut,” in Parallel combinatorial optimization, E. Talbi, Ed., New York: Wiley, 2006, p. 53–101. [Bibtex]
    @InCollection{ Ral06,
    address  = {New York},
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    booktitle  = {Parallel Combinatorial Optimization},
    editor  = {{E. Talbi}},
    pages = {53--101},
    publisher  = {Wiley},
    title = {{Parallel Branch and Cut}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/PBandC.pdf},
    year = {2006},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ RalSalWie06,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Saltzman, M.J. and Wiecek, M.M.},
    doi = {10.1007/s10479-006-0058-z},
    journal  = {Annals of Operations Research},
    pages = {43--70},
    title = {{An Improved Algorithm for Biobjective Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BICRIT2.pdf},
    volume  = {147},
    year = {2006},
    }
  • Q. Han, D. Du, J. Vera, and L. Zululaga, “Improved bounds for the symmetric rendezvous problem on the line,” Operations research, vol. 56, iss. 3, p. 772–782, 2006. [Bibtex]
    @article{han2006improved,
    title={Improved bounds for the symmetric rendezvous problem on the line},
    author={Han, Q and Du, D and Vera, JC and Zululaga, LF},
    journal={Operations Research},
    volume={56},
    number={3},
    pages={772--782},
    year = {2006},
    }
  • L. F. Zuluaga, J. Vera, and J. Peña, “LMI approximations for cones of positive semidefinite forms,” Siam journal on optimization, vol. 16, iss. 4, p. 1076–1091, 2006. [Bibtex]
    @article{zuluaga2006lmi,
    title={{LMI} approximations for cones of positive semidefinite forms},
    author={Zuluaga, Luis F and Vera, Juan and Pe{\~n}a, Javier},
    journal={SIAM Journal on Optimization},
    volume={16},
    number={4},
    pages={1076--1091},
    year = {2006},
    publisher={SIAM}
    }

2005

  • [Download PDF] E. Amaldi, P. Belotti, and R. Hauser, “Randomized relaxation methods for the maximum feasible subsystem problem,” in Integer programming and combinatorial optimization, 11th international ipco conference, berlin, germany, june 8-10, 2005, 2005, pp. 249-264. [Bibtex]
    @inproceedings{AmaldiBH05,
    author = {E. Amaldi and
    P. Belotti and
    R. Hauser},
    title = {Randomized Relaxation Methods for the Maximum Feasible Subsystem
    Problem},
    booktitle = {Integer Programming and Combinatorial Optimization, 11th
    International IPCO Conference, Berlin, Germany, June 8-10,
    2005},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    volume = {3509},
    year = {2005},
    pages = {249-264},
    ee = {http://dx.doi.org/10.1007/11496915_19},
    isbn = {3-540-26199-0},
    editor = {M. J{\"u}nger and
    V. Kaibel},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://www.springerlink.com/content/wnhkbrwqncartxly/}
    }
  • [Download PDF] P. Belotti, “Multicommodity network design with survivability constraints: some models and algorithms,” 4or, vol. 3, iss. 1, pp. 79-81, 2005. [Bibtex]
    @article{Belotti05,
    author = {P. Belotti},
    title = {Multicommodity network design with survivability constraints:
    Some models and algorithms},
    journal = {4OR},
    volume = {3},
    number = {1},
    year = {2005},
    pages = {79-81},
    ee = {http://dx.doi.org/10.1007/s10288-004-0047-5},
    bibsource = {DBLP, http://dblp.uni-trier.de},
    url = {http://www.springerlink.com/content/k0qp5xn585716234/}
    }
  • P. Belotti and F. Malucelli, “Row-column generation for multilayer network design,” in INOC 2005, Lisbon, Portugal, 2005, pp. 422-427. [Bibtex]
    @inproceedings{BelottiM2005,
    author = {P. Belotti and F. Malucelli},
    title = {Row-column generation for multilayer network design},
    booktitle = {{INOC} 2005},
    address = {Lisbon, Portugal},
    pages = {422-427},
    month = {March},
    year = {2005},
    }
  • [Download PDF] R. T. Berger and S. Kishore, “Network upgrade design in tiered cdma cellular networks,” Industrial and Systems Engineering, Lehigh University 2005. [Bibtex]
    @techreport{berger.kishore:05,
    author="Berger, R T and Kishore, S",
    title = "Network Upgrade Design in Tiered CDMA Cellular Networks",
    institution = "Industrial and Systems Engineering, Lehigh University",
    url = "http://coral.ie.lehigh.edu/pubs/files/rtb3_TWC_v1.pdf",
    year = {2005},
    }
  • [Download PDF] J. T. Linderoth, “A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs,” Mathematical programming, series b, vol. 103, pp. 251-282, 2005. [Bibtex]
    @article{linderoth:05-1,
    author = "J. T. Linderoth",
    title = "A Simplicial Branch-and-Bound Algorithm for Solving Quadratically Constrained Quadratic Programs",
    journal = "Mathematical Programming, Series B",
    volume = 103,
    year = {2005},
    pages = "251-282",
    url = "http://coral.ie.lehigh.edu/pubs/files/jtl3_simplicial.pdf"
    }
  • J. T. Linderoth and S. J. Wright, “Computational grids for stochastic programming,” in Applications of stochastic programming, S. Wallace and W. Ziemba, Eds., SIAM, 2005, pp. 61-77. [Bibtex]
    @incollection{linderoth.wright:05,
    author = "J. T. Linderoth and S. J. Wright",
    title = "Computational Grids for Stochastic Programming",
    booktitle = "Applications of Stochastic Programming",
    editor = "S. Wallace and W. Ziemba",
    series = "SIAM Mathematical Series on Optimization",
    year = {2005},
    pages = "61-77",
    publisher = "SIAM",
    }
  • [Download PDF] J. T. Linderoth and T. K. Ralphs, “Noncommercial software for mixed-integer linear programming,” in Integer programming: theory and practice, 2005, pp. 253-303. [Bibtex]
    @inproceedings{linderoth.ralphs:05,
    AUTHOR = "J. T. Linderoth and T. K. Ralphs",
    TITLE = "Noncommercial software for Mixed-Integer Linear Programming",
    BOOKTITLE = "Integer Programming: Theory and Practice",
    PAGES = {253-303},
    PUBLISHER = "CRC Press Operations Research Series",
    year = {2005},
    URL = "http://coral.ie.lehigh.edu/pubs/files/jtl3_noncomm.pdf"
    }
  • L. V. Snyder and M. S. Daskin, “Reliability models for facility location: the expected failure cost case,” Transportation Science, vol. 39, iss. 3, pp. 400-416, 2005. [Bibtex]
    @article{SnyderDaskin05,
    author={Snyder, L. V. and M. S. Daskin},
    title={Reliability models for facility location: The expected failure cost case},
    journal={{Transportation Science}},
    volume={39},
    number={3},
    pages={400-416},
    year = {2005},
    }
  • M. S. Daskin, L. V. Snyder, and R. T. Berger, “Facility location in supply chain design,” in Logistics systems: design and operation, A. Langevin and D. Riopel, Eds., New York: Springer, 2005, pp. 39-66. [Bibtex]
    @incollection{DaskinSnyderBerger05,
    author={Daskin, M. S. and L. V. Snyder and R. T. Berger},
    title={Facility location in supply chain design},
    booktitle={Logistics Systems: Design and Operation},
    editor={A. Langevin and D. Riopel},
    publisher={New York: Springer},
    chapter={2},
    pages={39-66},
    year = {2005},
    }
  • [Download PDF] A. G. Hadigheh and T. Terlaky, “Sensitivity analysis in convex quadratic optimization: invariant support set intervals,” Optimization, vol. 54, iss. 1, p. 59–79, 2005. [Bibtex]
    @Article{Hadigheh2005,
    Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
    Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
    Journal = {Optimization},
    year = {2005},
    Number = {1},
    Pages = {59--79},
    Volume = {54},
    Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • [DOI] [Download PDF] J. Peng, T. Terlaky, and Y. Zhao, “A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function,” Siam j. on optimization, vol. 15, p. 1105–1127, 2005. [Bibtex]
    @Article{Peng2005,
    Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
    Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
    Journal = {SIAM J. on Optimization},
    year = {2005},
    Month = {April},
    Pages = {1105--1127},
    Volume = {15},
    Acmid = {1081209},
    Address = {Philadelphia, PA, USA},
    Doi = {10.1137/040603991},
    ISSN = {1052-6234},
    Issue = {4},
    Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
    Numpages = {23},
    Publisher = {Society for Industrial and Applied Mathematics},
    Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • [Download PDF] M. Salahi and T. Terlaky, “An adaptive self-regular proximity-based large-update ipm for lo,” Optimization methods and software, vol. 20, iss. 1, pp. 169-185, 2005. [Bibtex]
    @Article{Salahi2005,
    Title = {An adaptive self-regular proximity-based large-update IPM for LO},
    Author = {Salahi, Maziar and Terlaky, Tamás},
    Journal = {Optimization Methods and Software},
    year = {2005},
    Number = {1},
    Pages = {169-185},
    Volume = {20},
    Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @InProceedings{ XuRalLadSal05,
    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.
    {\textcopyright} 2005 Springer Science+Business Media,
    Inc.},
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Xu, Y. and Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman,
    M.J.},
    booktitle  = {The Proceedings of the Ninth INFORMS Computing Society
    Conference},
    doi = {10.1007/0-387-23529-9_21},
    issn = {1387666X},
    keywords  = {Branch and bound,Integer programming,Parallel
    algorithm,Software},
    pages = {319--334},
    title = {{ALPS: A Framework for Implementing Parallel Tree Search
    Algorithms}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ALPS04.pdf},
    volume  = {29},
    year = {2005},
    }
  • [Download 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. [Bibtex]
    @InCollection{ RalGal05,
    author  = {Ralphs, T.K. and Galati, M.V.},
    booktitle  = {Integer Programming: Theory and Practice},
    editor  = {Karlof, J},
    pages = {57--110},
    publisher  = {CRC Press},
    title = {{Decomposition in Integer Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/DECOMP04.pdf}
    ,
    year = {2005},
    }
  • [Download PDF] 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. [Bibtex]
    @InCollection{ LinRal05,
    author  = {Linderoth, J.T. and Ralphs, T.K.},
    booktitle  = {Integer Programming: Theory and Practice},
    editor  = {Karlof, J},
    pages = {253--303},
    publisher  = {CRC Press},
    title = {{Noncommercial Software for Mixed-Integer Linear
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MILP04.pdf},
    year = {2005},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @InProceedings{ RalGuz05,
    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.
    {\textcopyright} 2005 Springer Science+Business Media,
    Inc.},
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
    booktitle  = {Proceedings of the Ninth INFORMS Computing Society
    Conference},
    doi = {10.1007/0-387-23529-9_5},
    issn = {1387666X},
    keywords  = {Branch and bound,Branch and cut,Integer
    programming,Sensitivity analysis,Software},
    pages = {61--76},
    title = {{The SYMPHONY Callable Library for Mixed Integer
    Programming}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/SYMPHONY04.pdf}
    ,
    year = {2005},
    }
  • L. F. Zuluaga and J. F. Peña, “A conic programming approach to generalized Tchebycheff inequalities,” Mathematics of operations research, vol. 30, iss. 2, p. 369–388, 2005. [Bibtex]
    @article{zuluaga2005conic,
    title={A conic programming approach to generalized {T}chebycheff inequalities},
    author={Zuluaga, Luis F and Pe{\~n}a, Javier F},
    journal={Mathematics of Operations Research},
    volume={30},
    number={2},
    pages={369--388},
    year = {2005},
    publisher={INFORMS}
    }

2004

  • [DOI] [Download PDF] P. Belotti and F. Malucelli, “Network design with grooming constraints,” Electronic notes in discrete mathematics, vol. 17, pp. 51-56, 2004. [Bibtex]
    @article{Belotti200451,
    title = "Network design with grooming constraints",
    journal = "Electronic Notes in Discrete Mathematics",
    volume = "17",
    number = "0",
    pages = "51-56",
    year = {2004},
    note = "Workshop on Graphs and Combinatorial Optimization",
    issn = "1571-0653",
    doi = "10.1016/j.endm.2004.03.013",
    url = "http://www.sciencedirect.com/science/article/pii/S1571065304010133",
    author = "P. Belotti and F. Malucelli"
    }
  • [Download PDF] F. E. Curtis, J. Drew, C. -K. Li, and D. Pragel, “Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying $A^2=J$,” Journal of Combinatorial Theory, Series A, vol. 105, iss. 1, p. 35–50, 2004. [Bibtex]
    @article{CurtDrewLiPrag04,
    author = {Curtis, F. E. and Drew, J. and Li, C.-K. and Pragel, D.},
    title = {{Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying $A^2=J$}},
    journal = {{Journal of Combinatorial Theory, Series A}},
    volume = {105},
    number = {1},
    pages = {35--50},
    year = {2004},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/papers/CurtDrewLiPrag04.pdf},
    papercite = {3. Journal Articles}
    }
  • W. Glankwamdee, “Lookahead branching for mixed integer programming,” Master Thesis, Bethlehem, PA, 2004. [Bibtex]
    @mastersthesis{glankwamdee:04,
    AUTHOR = "W. Glankwamdee",
    TITLE = "Lookahead Branching for Mixed Integer Programming",
    year = {2004},
    SCHOOL = "Department of Industrial and Systems Engineering, Lehigh University",
    ADDRESS = "Bethlehem, PA",
    }
  • [Download PDF] C. K. Anand, T. Terlaky, and B. Wang, “Rapid, embeddable design method for spiral magnetic resonance image reconstruction resampling kernels,” Optimization and engineering, vol. 5, pp. 485-502, 2004. [Bibtex]
    @Article{Anand2004,
    Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
    Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
    Journal = {Optimization and Engineering},
    year = {2004},
    Note = {10.1023/B:OPTE.0000042036.04931.49},
    Pages = {485-502},
    Volume = {5},
    ISSN = {1389-4420},
    Issue = {4},
    Keyword = {Engineering},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • [Download PDF] F. Glineur and T. Terlaky, “Conic formulation for lp-norm optimization,” Journal of optimization theory and applications, vol. 122, pp. 285-307, 2004. [Bibtex]
    @Article{Glineur2004,
    Title = {Conic Formulation for lp-Norm Optimization},
    Author = {Glineur, F. and Terlaky, T.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {2004},
    Note = {10.1023/B:JOTA.0000042522.65261.51},
    Pages = {285-307},
    Volume = {122},
    ISSN = {0022-3239},
    Issue = {2},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris optimalizálás, (in hungarian, english title: nonlinear optimization), Budapest, Hungary: Aula Publishing, 2004. [Bibtex]
    @Book{Klerk2004,
    Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
    Author = {de Klerk, E and Roos, C. and Terlaky, T.},
    Publisher = {Aula Publishing},
    year = {2004},
    Address = {Budapest, Hungary}
    }
  • [Download PDF] M. Salahi, R. Sotirov, and T. Terlaky, “On self-regular ipms,” Top, vol. 12, pp. 209-275, 2004. [Bibtex]
    @Article{Salahi2004,
    Title = {On self-regular IPMs},
    Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
    Journal = {TOP},
    year = {2004},
    Note = {10.1007/BF02578956},
    Pages = {209-275},
    Volume = {12},
    Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
    ISSN = {1134-5764},
    Issue = {2},
    Keyword = {Business and Economics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • [Download PDF] 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 04T-004, Lehigh University 2004. [Bibtex]
    @TechReport{ RalSalWie04,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Saltzman, M.J. and Wiecek, M.M.},
    institution  = {COR@L Laboratory Report 04T-004, Lehigh University},
    title = {{An Improved Algorithm for Biobjective Integer Programming
    and Its Application to Network Routing Problems}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BICRIT.pdf},
    year = {2004},
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ RalLadSal04,
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
    doi = {10.1023/B:SUPE.0000020179.55383.ad},
    journal  = {Journal of Supercomputing},
    pages = {215--234},
    title = {{A Library Hierarchy for Implementing Scalable Parallel
    Search Algorithms}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/JSC02.pdf},
    volume  = {28},
    year = {2004},
    }
  • [Download PDF] R. Lougee-Heimer, M. J. Saltzman, and T. K. Ralphs, COIN of the OR Realm, 2004. [Bibtex]
    @Misc{ LouSalRal04,
    author  = {Lougee-Heimer, R. and Saltzman, M.J. and Ralphs, T.K.},
    journal  = {OR/MS Today},
    month = {oct},
    title = {{COIN of the OR Realm}},
    url = {http://www.lionhrtpub.com/orms/orms-10-04/frcoin.html},
    year = {2004},
    }
  • T. K. Ralphs, “SYMPHONY Version 5.0 User’s Manual,” COR@L Laboratory, Lehigh University, Technical Report , 2004. [Bibtex]
    @TechReport{ Ral04,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 5.0 User's Manual}},
    type = {Technical Report},
    year = {2004},
    }
  • [Download PDF] T. K. Ralphs and M. Güzelsoy, “Duality, Warm Starting, and Sensitivity Analysis in Integer Programming,” COR@L Laboratory Report 04T-022, Lehigh University 2004. [Bibtex]
    @TechReport{ RalGuz04,
    annote  = {Available by request},
    author  = {Ralphs, T.K. and G{\"u}zelsoy, M.},
    institution  = {COR@L Laboratory Report 04T-022, Lehigh University},
    title = {{Duality, Warm Starting, and Sensitivity Analysis in
    Integer Programming}},
    url = {http://ise.lehigh.edu/sites/ise.lehigh.edu/files/04t{\_}022.pdf}
    ,
    year = {2004},
    }

2003

  • [Download PDF] P. Belotti and F. Malucelli, “A lagrangian relaxation approach to network design with shared protection,” in INOC 2003, Paris-Evry (France), 2003, pp. 72-77. [Bibtex]
    @inproceedings{BelottiM2003,
    author = {P. Belotti and F. Malucelli},
    title = {A Lagrangian relaxation approach to network design with shared protection},
    booktitle = {{INOC} 2003},
    address = {Paris-Evry (France)},
    year = {2003},
    pages = "72-77",
    url = {{http://coral.ie.lehigh.edu/~belotti/papers/belotti-shared_protection.pdf}}
    }
  • P. Belotti, Multicommodity network design with survivability constraints: models and algorithms, Dipartimento di Elettronica e Informazione, Politecnico di Milano: PhD Thesis, 2003. [Bibtex]
    @book{Belotti2003,
    author = {P. Belotti},
    title = {Multicommodity network design with survivability constraints: models and algorithms},
    address = {Dipartimento di Elettronica e Informazione, Politecnico di Milano},
    publisher = {PhD Thesis},
    year = {2003},
    type = {{Ph.D.} thesis},
    }
  • [Download PDF] F. E. Curtis, Special Classes of Zero-One Matrices, 2003. [Bibtex]
    @unpublished{Curt03,
    author = {Curtis, F. E.},
    title = {{Special Classes of Zero-One Matrices}},
    note = {Undergraduate Honors Thesis, Department of Mathematics, College of William and Mary, Williamsburg, VA, USA},
    year = {2003},
    url = {http://coral.ise.lehigh.edu/frankecurtis/files/dissertations/Curt03.pdf},
    papercite = {5. Theses}
    }
  • J. T. Linderoth and S. J. Wright, “Implementing a decomposition algorithm for stochastic programming on a computational grid,” Computational optimization and applications, vol. 24, p. 207–250, 2003. [Bibtex]
    @article{linderoth.wright:03,
    AUTHOR = "J. T. Linderoth and S. J. Wright",
    TITLE = "Implementing a Decomposition Algorithm for Stochastic
    Programming on a Computational Grid",
    JOURNAL = "Computational Optimization and Applications",
    VOLUME = 24,
    PAGES = "207--250",
    year = {2003},
    }
  • L. V. Snyder, “Supply chain robustness and reliability: Models and algorithms,” PhD Thesis, 2003. [Bibtex]
    @phdthesis{SnyderDiss03,
    author={Snyder, L. V},
    title={{Supply chain robustness and reliability: Models and algorithms}},
    school={{Northwestern University, Department of Industrial Engineering and Management Sciences}},
    year = {2003},
    }
  • [Download PDF] E. D. Andersen, C. Roos, and T. Terlaky, “On implementing a primal-dual interior-point method for conic quadratic optimization,” Mathematical programming, vol. 95, pp. 249-277, 2003. [Bibtex]
    @Article{Andersen2003,
    Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
    Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
    Journal = {Mathematical Programming},
    year = {2003},
    Note = {10.1007/s10107-002-0349-3},
    Pages = {249-277},
    Volume = {95},
    Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
    ISSN = {0025-5610},
    Issue = {2},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, “An efficient optimization method in groundwater resource management,” Water south africa, vol. 29, iss. 4, p. 359–364, 2003. [Bibtex]
    @Article{Ndambuki2003,
    Title = {An Efficient Optimization Method in Groundwater Resource Management},
    Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
    Journal = {Water South Africa},
    year = {2003},
    Number = {4},
    Pages = {359--364},
    Volume = {29}
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @Article{ RalLadSal03,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
    doi = {10.1007/s10107-003-0404-8},
    journal  = {Mathematical Programming},
    pages = {253--280},
    title = {{Parallel Branch, Cut, and Price for Large-Scale Discrete
    Optimization}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/PBCP.pdf},
    volume  = {98},
    year = {2003},
    }
  • [DOI] [Download PDF] T. K. Ralphs, “Parallel Branch and Cut for Capacitated Vehicle Routing,” Parallel computing, vol. 29, p. 607–629, 2003. [Bibtex]
    @Article{ Ral03,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    doi = {10.1016/S0167-8191(03)00045-0},
    journal  = {Parallel Computing},
    pages = {607--629},
    title = {{Parallel Branch and Cut for Capacitated Vehicle
    Routing}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/PVRP.pdf},
    volume  = {29},
    year = {2003},
    }
  • T. K. Ralphs, “SYMPHONY Version 4.0 User’s Manual,” COR@L Laboratory, Lehigh University, Technical Report , 2003. [Bibtex]
    @TechReport{ Ral03-1,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{SYMPHONY Version 4.0 User's Manual}},
    type = {Technical Report},
    year = {2003},
    }
  • [DOI] [Download PDF] T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter Jr., “On the Capacitated Vehicle Routing Problem,” Mathematical programming, vol. 94, p. 343–359, 2003. [Bibtex]
    @Article{ RalKopPulTro-Jr03,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Kopman, L. and Pulleyblank, W.R. and
    Trotter Jr., L.E.},
    doi = {10.1007/s10107-002-0323-0},
    journal  = {Mathematical Programming},
    pages = {343--359},
    title = {{On the Capacitated Vehicle Routing Problem}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/VRP.pdf},
    volume  = {94},
    year = {2003},
    }

2002

  • D. Simchi-Levi, L. Snyder, and M. Watson, “Strategies for uncertain times,” Supply chain management review, vol. 6, iss. 1, p. 11–12, 2002. [Bibtex]
    @article{Simchi-LeviSnyderWatson02,
    author={Simchi-Levi, D. and L. Snyder and M. Watson},
    title={Strategies for uncertain times},
    journal={Supply Chain Management Review},
    volume={6},
    number={1},
    pages={11–12},
    year = {2002},
    }
  • [Download PDF] E. D. Andersen, C. Roos, and T. Terlaky, “Notes on duality in second order and p-order cone optimization,” Optimization: a journal of mathematical programming and operations research, vol. 51, iss. 4, p. 627 – 643, 2002. [Bibtex]
    @Article{Andersen2002,
    Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
    Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
    Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
    year = {2002},
    Number = {4},
    Pages = {627 -- 643},
    Volume = {51},
    Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • [Download PDF] T. Illes and T. Terlaky, “Pivot versus interior point methods: pros and cons,” European journal of operational research, vol. 140, iss. 2, pp. 170-190, 2002. [Bibtex]
    @Article{Illes2002,
    Title = {Pivot versus interior point methods: Pros and cons},
    Author = {Illes, Tibor and Terlaky, Tamas},
    Journal = {European Journal of Operational Research},
    year = {2002},
    Month = {July},
    Number = {2},
    Pages = {170-190},
    Volume = {140},
    Abstract = {No abstract is available for this item.},
    Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-regularity: a new paradigm for primal dual interior point methods, Princeton University Press, 2002. [Bibtex]
    @Book{Peng2002,
    Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
    Author = {Peng, J. and Roos, C. and Terlaky, T.},
    Publisher = {Princeton University Press},
    year = {2002},
    }
  • [Download PDF] J. Peng, C. Roos, and T. Terlaky, “Primal-dual interior-point methods for second-order conic optimization based on self-regular proximities,” Siam journal on optimization, vol. 13, iss. 1, pp. 179-203, 2002. [Bibtex]
    @Article{Peng2002a,
    Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
    Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
    Journal = {SIAM Journal on Optimization},
    year = {2002},
    Number = {1},
    Pages = {179-203},
    Volume = {13},
    Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
    Publisher = {SIAM},
    Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • [Download PDF] J. Peng, C. Roos, and T. Terlaky, “A new class of polynomial primal-dual methods for linear and semidefinite optimization,” European journal of operational research, vol. 143, iss. 2, pp. 234-256, 2002. [Bibtex]
    @Article{Peng2002b,
    Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
    Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
    Journal = {European Journal of Operational Research},
    year = {2002},
    Number = {2},
    Pages = {234 - 256},
    Volume = {143},
    ISSN = {0377-2217},
    Keywords = {Linear optimization},
    Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • [Download PDF] J. Peng, C. Roos, and T. Terlaky, “Self-regular functions and new search directions for linear and semidefinite optimization,” Mathematical programming, vol. 93, pp. 129-171, 2002. [Bibtex]
    @Article{Peng2002d,
    Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
    Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
    Journal = {Mathematical Programming},
    year = {2002},
    Note = {10.1007/s101070200296},
    Pages = {129-171},
    Volume = {93},
    Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
    ISSN = {0025-5610},
    Issue = {1},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • [Download PDF] J. Peng and T. Terlaky, “A dynamic large-update primal-dual interior-point method for linear optimization,” Optimization methods and software, vol. 17, iss. 6, p. 1077 – 1104, 2002. [Bibtex]
    @Article{Peng2002c,
    Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
    Author = {Peng, Jiming and Terlaky, Tamás},
    Journal = {Optimization Methods and Software},
    year = {2002},
    Number = {6},
    Pages = {1077 -- 1104},
    Volume = {17},
    Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • [DOI] [Download PDF] 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. [Bibtex]
    @InProceedings{ LadRalSal02,
    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. {\textcopyright} 2002
    Springer-Verlag Berlin Heidelberg.},
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Lad{\'a}nyi, L. and Ralphs, T.K. and Saltzman, M.J.},
    booktitle  = {Proceedings of the International Conference on
    Computational Science},
    doi = {10.1007/3-540-46043-8_60},
    isbn = {3540435913},
    issn = {03029743},
    pages = {592--602},
    title = {{Implementing Scalable Parallel Search Algorithms for
    Data-Intensive Applications}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ICCS02.pdf},
    year = {2002},
    }

2001

  • [Download PDF] P. Belotti and T. Stidsen, “Optimal placement of wavelength converting nodes,” in Third international workshop on design of reliable communcation networks, 2001, pp. 15-21. [Bibtex]
    @inproceedings{BelottiStidsenDRCN2001,
    author = "P. Belotti and T. Stidsen",
    title = "Optimal Placement of Wavelength Converting Nodes",
    year = {2001},
    month = "nov",
    keywords = "Optical Networks, Linear Programming, Wavelength Converting Nodes",
    booktitle = "Third International Workshop on Design of Reliable Communcation Networks",
    volume = "",
    series = "",
    pages = "15-21",
    editor = "",
    publisher = "",
    organization = "",
    address = "",
    url = "http://www2.imm.dtu.dk/pubdb/p.php?432",
    abstract = "The all optical network using {WDM} and optical nodes (OXC's) seems to
    be a possibility in a near future. The consensus to day seems to be
    that optical wavelength conversions is un-realistic for several
    decades, hence wavelength blocking will happen in the all optical
    networks. A possible solution to this problem could be to include
    digital nodes (DXC's) in the network at the right places. In this
    article we present a linear programming model which optimizes the
    placement of these more expensive {DXC'}s in the network."
    }
  • [DOI] [Download PDF] P. E. A. van der Lee, T. Terlaky, and T. Woudstra, “A new approach to optimizing energy systems,” Computer methods in applied mechanics and engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. [Bibtex]
    @Article{Lee2001,
    Title = {A new approach to optimizing energy systems},
    Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
    Journal = {Computer Methods in Applied Mechanics and Engineering},
    year = {2001},
    Number = {40-41},
    Pages = {5297 - 5310},
    Volume = {190},
    Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
    ISSN = {0045-7825},
    Keywords = {Combined cycle},
    Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • [DOI] [Download PDF] J. Peng, C. Roos, and T. Terlaky, “New complexity analysis of the primal\—dual method for semidefinite optimization based on the nesterov\—todd direction,” J. optim. theory appl., vol. 109, p. 327–343, 2001. [Bibtex]
    @Article{Peng2001,
    Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
    Author = {Peng, J. and Roos, C. and Terlaky, T.},
    Journal = {J. Optim. Theory Appl.},
    year = {2001},
    Month = {May},
    Pages = {327--343},
    Volume = {109},
    Acmid = {380598},
    Address = {New York, NY, USA},
    Doi = {10.1023/A:1017514422146},
    ISSN = {0022-3239},
    Issue = {2},
    Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
    Numpages = {17},
    Publisher = {Plenum Press},
    Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • [Download PDF] A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, “Reloading nuclear reactor fuel using mixed-integer nonlinear optimization,” Optimization and engineering, vol. 2, pp. 251-276, 2001. [Bibtex]
    @Article{Quist2001,
    Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
    Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
    Journal = {Optimization and Engineering},
    year = {2001},
    Note = {10.1023/A:1015354615402},
    Pages = {251-276},
    Volume = {2},
    ISSN = {1389-4420},
    Issue = {3},
    Keyword = {Engineering},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • [DOI] [Download PDF] T. Terlaky, “An easy way to teach interior-point methods,” European journal of operational research, vol. 130, iss. 1, pp. 1-19, 2001. [Bibtex]
    @Article{Terlaky2001,
    Title = {An easy way to teach interior-point methods},
    Author = {Tam\'as Terlaky},
    Journal = {European Journal of Operational Research},
    year = {2001},
    Number = {1},
    Pages = {1 - 19},
    Volume = {130},
    Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
    ISSN = {0377-2217},
    Keywords = {Linear optimization},
    Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, “Algorithmic concepts for linear optimization,” Cors-scoro bulletin, vol. 35, iss. 2, p. 7–33, 2001. [Bibtex]
    @Article{Terlaky2001a,
    Title = {Algorithmic Concepts for Linear Optimization},
    Author = {Terlaky, T.},
    Journal = {CORS-SCORO Bulletin},
    year = {2001},
    Number = {2},
    Pages = {7--33},
    Volume = {35}
    }
  • [Download PDF] R. Lougee-Heimer, M. J. Saltzman, and T. K. Ralphs, The COIN-OR Initiative: Open-source Software Accelerates Operations Research Progress, 2001. [Bibtex]
    @Misc{ LouSalRal01,
    author  = {Lougee-Heimer, R. and Saltzman, M.J. and Ralphs, T.K.},
    journal  = {OR/MS Today},
    title = {{The COIN-OR Initiative: Open-source Software Accelerates
    Operations Research Progress}},
    url = {http://lionhrtpub.com/orms/orms-10-01/forumfr.html},
    year = {2001},
    }
  • [DOI] [Download PDF] L. Ladányi, T. K. Ralphs, and L. E. Trotter Jr., “Branch, Cut, and Price: Sequential and Parallel,” in Computational combinatorial optimization, D. Naddef and M. Juenger, Eds., Berlin: Springer, 2001, p. 223–260. [Bibtex]
    @InCollection{ LadRalTro-Jr01,
    address  = {Berlin},
    author  = {Lad{\'a}nyi, L. and Ralphs, T.K. and Trotter Jr., L.E.},
    booktitle  = {Computational Combinatorial Optimization},
    doi = {10.1007/3-540-45586-8_6},
    editor  = {Naddef, D and Juenger, M},
    pages = {223--260},
    publisher  = {Springer},
    title = {{Branch, Cut, and Price: Sequential and Parallel}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/LNCS.pdf},
    year = {2001},
    }
  • [Download PDF] T. K. Ralphs and L. Ladányi, “COIN/BCP User’s Manual,” COR@L Laboratory, Lehigh University 2001. [Bibtex]
    @TechReport{ RalLad01,
    software  = {http://projects.coin-or.org/Bcp},
    author  = {Ralphs, T.K. and Lad{\'a}nyi, L.},
    institution  = {COR@L Laboratory, Lehigh University},
    title = {{COIN/BCP User's Manual}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/BCP-Manual.pdf}
    ,
    year = {2001},
    }
  • [Download PDF] T. K. Ralphs, L. Ladányi, and M. J. Saltzman, “A Library Hierarchy for Implementing Scalable Parallel Search Algorithms,” Industrial and Systems Engineering, Lehigh University 2001. [Bibtex]
    @TechReport{ RalLadSal01,
    software  = {https://projects.coin-or.org/CHiPPS},
    author  = {Ralphs, T.K. and Lad{\'a}nyi, L. and Saltzman, M.J.},
    institution  = {Industrial and Systems Engineering, Lehigh University},
    title = {{A Library Hierarchy for Implementing Scalable Parallel
    Search Algorithms}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/ALPS.pdf},
    year = {2001},
    }
  • [Download PDF] T. K. Ralphs and J. C. Hartman, “Capacitated Network Routing (A Preliminary Progress Report),” COR@L Laboratory Report 01W-009, Lehigh University 2001. [Bibtex]
    @TechReport{ RalHar01,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Hartman, J.C.},
    institution  = {COR@L Laboratory Report 01W-009, Lehigh University},
    title = {{Capacitated Network Routing (A Preliminary Progress
    Report)}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/CNRP.pdf},
    year = {2001},
    }

2000

  • [DOI] [Download PDF] I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, “On copositive programming and standard quadratic optimization problems,” J. of global optimization, vol. 18, p. 301–320, 2000. [Bibtex]
    @Article{Bomze2000,
    Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
    Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
    Journal = {J. of Global Optimization},
    year = {2000},
    Month = {December},
    Pages = {301--320},
    Volume = {18},
    Acmid = {596351},
    Address = {Hingham, MA, USA},
    Doi = {10.1023/A:1026583532263},
    ISSN = {0925-5001},
    Issue = {4},
    Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
    Numpages = {20},
    Publisher = {Kluwer Academic Publishers},
    Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • [DOI] [Download PDF] T. Illés, J. Peng, C. Roos, and T. Terlaky, “A strongly polynomial rounding procedure yielding a maximally complementary solution for $P_*(\kappa)$ linear complementarity problems,” Siam journal on optimization, vol. 11, iss. 2, pp. 320-340, 2000. [Bibtex]
    @Article{Illes2000,
    Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
    Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
    Journal = {SIAM Journal on Optimization},
    year = {2000},
    Number = {2},
    Pages = {320-340},
    Volume = {11},
    Doi = {10.1137/S1052623498336590},
    Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
    Publisher = {SIAM},
    Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • [DOI] [Download PDF] E. de Klerk, J. Peng, C. Roos, and T. Terlaky, “A scaled gauss–newton primal-dual search direction for semidefinite optimization,” Siam j. on optimization, vol. 11, p. 870–888, 2000. [Bibtex]
    @Article{Klerk2000,
    Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
    Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
    Journal = {SIAM J. on Optimization},
    year = {2000},
    Month = {April},
    Pages = {870--888},
    Volume = {11},
    Acmid = {589015},
    Address = {Philadelphia, PA, USA},
    Doi = {http://dx.doi.org/10.1137/S1052623499352632},
    ISSN = {1052-6234},
    Issue = {4},
    Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
    Numpages = {19},
    Publisher = {Society for Industrial and Applied Mathematics},
    Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • [DOI] [Download PDF] T. Koltai and T. Terlaky, “The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming,” International journal of production economics, vol. 65, iss. 3, pp. 257-274, 2000. [Bibtex]
    @Article{Koltai2000257,
    Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
    Author = {Tam\'as Koltai and Tam\'as Terlaky},
    Journal = {International Journal of Production Economics},
    year = {2000},
    Number = {3},
    Pages = {257 - 274},
    Volume = {65},
    Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
    ISSN = {0925-5273},
    Keywords = {Linear programming},
    Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • [Download PDF] J. Peng, C. Roos, and T. Terlaky, “New complexity analysis of the primal—dual newton method for linear optimization,” Annals of operations research, vol. 99, pp. 23-39, 2000. [Bibtex]
    @Article{Peng2000,
    Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
    Author = {Peng, J. and Roos, C. and Terlaky, T.},
    Journal = {Annals of Operations Research},
    year = {2000},
    Note = {10.1023/A:1019280614748},
    Pages = {23-39},
    Volume = {99},
    ISSN = {0254-5330},
    Issue = {1},
    Keyword = {Computer Science},
    Publisher = {Springer Netherlands},
    Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • T. K. Ralphs and L. Ladányi, “SYMPHONY: A Parallel Framework for Branch, Cut, and Price,” Rice University 2000. [Bibtex]
    @TechReport{ RalLad00,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K. and Lad{\'a}nyi, L.},
    institution  = {Rice University},
    title = {{SYMPHONY: A Parallel Framework for Branch, Cut, and
    Price}},
    year = {2000},
    }
  • G. Cornuéjols and L. F. Zuluaga, “On padberg’s conjecture about almost totally unimodular matrices,” Operations research letters, vol. 27, iss. 3, p. 97–99, 2000. [Bibtex]
    @article{cornuejols2000padberg,
    title={On Padberg's conjecture about almost totally unimodular matrices},
    author={Cornu{\'e}jols, G{\'e}rard and Zuluaga, Luis F},
    journal={Operations Research Letters},
    volume={27},
    number={3},
    pages={97--99},
    year = {2000},
    publisher={Elsevier}
    }

1999

  • [Download PDF] A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, “Basis- and partition identification for quadratic programming and linear complementarity problems,” Mathematical programming, vol. 86, pp. 261-282, 1999. [Bibtex]
    @Article{Berkelaar1999,
    Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
    Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
    Journal = {Mathematical Programming},
    year = {1999},
    Note = {10.1007/s101070050089},
    Pages = {261-282},
    Volume = {86},
    Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
    ISSN = {0025-5610},
    Issue = {2},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • [Download PDF] K. Fukuda and T. Terlaky, “On the existence of a short admissible pivot sequence for feasibility and linear optimization problems,” Pure mathematics and applications, vol. 10, iss. 4, pp. 431-447, 1999. [Bibtex]
    @Article{Fukuda1999,
    Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
    Author = {Fukuda, K. and Terlaky, T.},
    Journal = {Pure Mathematics and Applications},
    year = {1999},
    Number = {4},
    Pages = {431-447},
    Volume = {10},
    Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • [Download PDF] T. Illes, A. Szirmai, and T. Terlaky, “The finite criss-cross method for hyperbolic programming,” European journal of operational research, vol. 114, iss. 1, pp. 198-214, 1999. [Bibtex]
    @Article{Illes1999,
    Title = {The finite criss-cross method for hyperbolic programming},
    Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
    Journal = {European Journal of Operational Research},
    year = {1999},
    Number = {1},
    Pages = {198-214},
    Volume = {114},
    Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, “Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions,” Applied numerical mathematics, vol. 29, iss. 3, p. 335–360, 1999. [Bibtex]
    @Article{Klerk1999,
    Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
    Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Applied Numerical Mathematics},
    year = {1999},
    Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
    Number = {3},
    Pages = {335--360},
    Volume = {29}
    }
  • [DOI] [Download PDF] Z. Luo, C. Roos, and T. Terlaky, “Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming,” Applied numerical mathematics, vol. 29, iss. 3, pp. 379-394, 1999. [Bibtex]
    @Article{Luo1999379,
    Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
    Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
    Journal = {Applied Numerical Mathematics},
    year = {1999},
    Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
    Number = {3},
    Pages = {379 - 394},
    Volume = {29},
    Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
    ISSN = {0168-9274},
    Keywords = {Semi-infinite linear programming},
    Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • [Download PDF] A. Nemirovski, C. Roos, and T. Terlaky, “On maximization of quadratic form over intersection of ellipsoids with common center,” Mathematical programming, vol. 86, pp. 463-473, 1999. [Bibtex]
    @Article{Nemirovski1999,
    Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
    Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
    Journal = {Mathematical Programming},
    year = {1999},
    Note = {10.1007/s101070050100},
    Pages = {463-473},
    Volume = {86},
    Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
    ISSN = {0025-5610},
    Issue = {3},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer Berlin / Heidelberg},
    Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, “Application of nonlinear optimization to reactor core fuel reloading,” Annals of nuclear energy, vol. 26, p. 423–448, 1999. [Bibtex]
    @Article{Quist1999,
    Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
    Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
    Journal = {Annals of Nuclear Energy},
    year = {1999},
    Pages = {423--448},
    Volume = {26}
    }
  • [Download PDF] A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, “Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics,” Engineering optimization, vol. 32, iss. 2, p. 143–176, 1999. [Bibtex]
    @Article{Quist1999a,
    Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
    Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
    Journal = {Engineering Optimization},
    year = {1999},
    Number = {2},
    Pages = {143--176},
    Volume = {32},
    Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • [DOI] [Download PDF] C. Roos and T. Terlaky, “Note on a paper of broyden,” Operations research letters, vol. 25, iss. 4, pp. 183-186, 1999. [Bibtex]
    @Article{Roos1999183,
    Title = {Note on a paper of Broyden},
    Author = {Cornelis Roos and Tam\'as Terlaky},
    Journal = {Operations Research Letters},
    year = {1999},
    Number = {4},
    Pages = {183 - 186},
    Volume = {25},
    Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
    ISSN = {0167-6377},
    Keywords = {Orthogonal matrices},
    Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • [Download PDF] T. Terlaky and T. Tsuchiya, “A note on mascarenhas’ counterexample about global convergence of the affine scaling algorithm,” Applied mathematics & optimization, vol. 40, pp. 287-314, 1999. [Bibtex]
    @Article{Terlaky1999,
    Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
    Author = {Terlaky, T. and Tsuchiya, T.},
    Journal = {Applied Mathematics \& Optimization},
    year = {1999},
    Note = {10.1007/s002459900127},
    Pages = {287-314},
    Volume = {40},
    Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
    ISSN = {0095-4616},
    Issue = {3},
    Keyword = {Mathematics and Statistics},
    Publisher = {Springer New York},
    Url = {http://dx.doi.org/10.1007/s002459900127}
    }

1998

  • [DOI] [Download PDF] H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, “On the dimension of the set of rim perturbations for optimal partition invariance,” Siam j. on optimization, vol. 9, p. 207–216, 1998. [Bibtex]
    @Article{Greenberg1998,
    Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
    Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
    Journal = {SIAM J. on Optimization},
    year = {1998},
    Month = {May},
    Pages = {207--216},
    Volume = {9},
    Acmid = {589113},
    Address = {Philadelphia, PA, USA},
    Doi = {http://dx.doi.org/10.1137/S1052623497316798},
    ISSN = {1052-6234},
    Issue = {1},
    Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
    Numpages = {10},
    Publisher = {Society for Industrial and Applied Mathematics},
    Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, “Polynomial primal–dual affine scaling algorithms in semidefinite programming,” Journal of combinatorial optimization, vol. 2, p. 51–69, 1998. [Bibtex]
    @Article{Klerk1998,
    Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
    Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Journal of Combinatorial Optimization},
    year = {1998},
    Pages = {51--69},
    Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, “A nonconvex weighted potential function for polynomial target following methods,” Annals of operations research, vol. 81, p. 3–14, 1998. [Bibtex]
    @Article{Klerk1998a,
    Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
    Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Annals of Operations Research},
    year = {1998},
    Pages = {3--14},
    Volume = {81}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, “Copositive relaxation for general quadratic programming,” Optimization methods and software, vol. 9, p. 185–208, 1998. [Bibtex]
    @Article{Quist1998,
    Title = {Copositive Relaxation for General Quadratic Programming},
    Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Optimization Methods and Software},
    year = {1998},
    Pages = {185--208},
    Volume = {9}
    }
  • T. Terlaky and J. Vial, “Computing maximum likelihood estimators of convex density functions,” Siam journal on scientific computing, vol. 19, iss. 2, p. 675–694, 1998. [Bibtex]
    @Article{Terlaky1998,
    Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
    Author = {Terlaky, T. and Vial, J.-Ph.},
    Journal = {SIAM Journal on Scientific Computing},
    year = {1998},
    Number = {2},
    Pages = {675--694},
    Volume = {19}
    }

1997

  • K. Fukuda and T. Terlaky, “Criss-cross methods: a fresh view on pivot algorithms,” Mathematical programming series b, vol. 79, iss. 1–3, p. 369–395, 1997. [Bibtex]
    @Article{Fukuda1997,
    Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
    Author = {Fukuda, K. and Terlaky, T.},
    Journal = {Mathematical Programming Series B},
    year = {1997},
    Number = {1--3},
    Pages = {369--395},
    Volume = {79}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, “Method of approximate centers for semi–definite programming,” Optimization methods and software, vol. 7, p. 291–309, 1997. [Bibtex]
    @Article{He1997,
    Title = {Method of Approximate Centers for Semi--Definite Programming},
    Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Optimization Methods and Software},
    year = {1997},
    Pages = {291--309},
    Volume = {7}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, “Sensitivity analysis in linear programming: just be careful!,” European journal of operational research, vol. 101, p. 15–28, 1997. [Bibtex]
    @Article{Jansen1997d,
    Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
    Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
    Journal = {European Journal of Operational Research},
    year = {1997},
    Pages = {15--28},
    Volume = {101}
    }
  • B. Jansen, C. Roos, and T. Terlaky, “A family of polynomial affine scaling algorithms for positive semidefinite linear complementarity problems,” Siam journal on optimization, vol. 7, iss. 1, p. 126–140, 1997. [Bibtex]
    @Article{Jansen1997,
    Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
    Author = {Jansen, B. and Roos, C. and Terlaky, T.},
    Journal = {SIAM Journal on Optimization},
    year = {1997},
    Number = {1},
    Pages = {126--140},
    Volume = {7}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, “A potential reduction approach to the frequency assignment problem,” Discrete applied mathematics, vol. 78, p. 252–282, 1997. [Bibtex]
    @Article{Jansen1997b,
    Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
    Journal = {Discrete Applied Mathematics},
    year = {1997},
    Pages = {252--282},
    Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, “Potential reduction algorithms for structured combinatorial optimization problems,” Operations research letters, vol. 21, iss. 2, p. 55–65, 1997. [Bibtex]
    @Article{Jansen1997c,
    Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
    Journal = {Operations Research Letters},
    year = {1997},
    Number = {2},
    Pages = {55--65},
    Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, “Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems,” Mathematical programming, vol. 78, p. 315–345, 1997. [Bibtex]
    @Article{Jansen1997a,
    Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
    Journal = {Mathematical Programming},
    year = {1997},
    Pages = {315--345},
    Volume = {78}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, “Logarithmic barrier decomposition methods for semi-infinite programming,” International transactions in operations research, vol. 4, iss. 4, p. 285–303, 1997. [Bibtex]
    @Article{Kaliski1997,
    Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
    Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
    Journal = {International Transactions in Operations Research},
    year = {1997},
    Number = {4},
    Pages = {285--303},
    Volume = {4}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, “Optimization of nuclear reactor reloading patterns,” Annals of operations research, vol. 69, p. 65–84, 1997. [Bibtex]
    @Article{Klerk1997,
    Title = {Optimization of Nuclear Reactor Reloading Patterns},
    Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
    Journal = {Annals of Operations Research},
    year = {1997},
    Pages = {65--84},
    Volume = {69}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, “Initialization in semidefinite programming via a self–dual, skew-symmetric embedding,” Operations research letters, vol. 20, iss. 5, p. 213–221, 1997. [Bibtex]
    @Article{Klerk1997a,
    Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
    Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
    Journal = {Operations Research Letters},
    year = {1997},
    Number = {5},
    Pages = {213--221},
    Volume = {20}
    }
  • H. van Maaren and T. Terlaky, “Inverse barriers and ces-functions in linear programming,” Operations research letters, vol. 20, p. 15–20, 1997. [Bibtex]
    @Article{Maaren1997,
    Title = {Inverse Barriers and CES-Functions in Linear Programming},
    Author = {van Maaren, H. and Terlaky, T.},
    Journal = {Operations Research Letters},
    year = {1997},
    Pages = {15--20},
    Volume = {20}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior point approach to linear optimization: theory and algorithms, Chichester, New York: John Wiley {&} Sons, 1997. [Bibtex]
    @Book{Roos1997,
    Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
    Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Publisher = {John Wiley {\&} Sons},
    year = {1997},
    Address = {Chichester, New York},
    Note = {(second print 1998)}
    }
  • M. Esö, L. Ladányi, T. K. Ralphs, and L. E. Trotter Jr., “Fully Parallel Generic Branch-and-Cut Framework,” in Proceedings of the eighth \SIAM\ conference on parallel processing for scientific computing, 1997. [Bibtex]
    @InProceedings{ EsoLadRalTro-Jr97,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Es{\"o}, M. and Lad{\'a}nyi, L. and Ralphs, T.K. and
    Trotter Jr., L.E.},
    booktitle  = {Proceedings of the Eighth {\{}SIAM{\}} Conference on
    Parallel Processing for Scientific Computing},
    title = {{Fully Parallel Generic Branch-and-Cut Framework}},
    year = {1997},
    }

1996

  • L. V. Snyder, “Combinatorial rigidity and the path decomposition of isostatic graphs,” {B.A. honors thesis, Amherst College, Department of Mathematics and Computer Science} PhD Thesis, 1996. [Bibtex]
    @phdthesis{SnyderBA,
    author={Snyder, L. V},
    title={{Combinatorial rigidity and the path decomposition of isostatic graphs}},
    year = {1996},
    type={{B.A. honors thesis, Amherst College, Department of Mathematics and Computer Science}},
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, “Long–step primal–dual target–following algorithms for linear programming,” Mathematical methods of operations research, vol. 44, p. 11–30, 1996. [Bibtex]
    @Article{Jan-sen1996,
    Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
    Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Journal = {Mathematical Methods of Operations Research},
    year = {1996},
    Pages = {11--30},
    Volume = {44}
    }
  • B. Jansen and C. Roos, “Interior point methods, a decade after karmarkar – a survey with application to the smallest eigenvalue problem,” Statistica neerlandica, vol. 50, p. 146–170, 1996. [Bibtex]
    @Article{Jansen1996b,
    Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
    Author = {Jansen, B. and Roos, C.},
    Journal = {Statistica Neerlandica},
    year = {1996},
    Pages = {146--170},
    Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, “A polynomial dikin–type primal–dual algorithm for linear programming,” Mathematics of operations research, vol. 21, p. 341 – 353, 1996. [Bibtex]
    @Article{Jansen1996,
    Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
    Author = {Jansen, B. and Roos, C. and Terlaky, T.},
    Journal = {Mathematics of Operations Research},
    year = {1996},
    Pages = {341 -- 353},
    Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, “Primal–dual target–following algorithms for linear programming,” Annals of operations research, vol. 62, p. 197–231, 1996. [Bibtex]
    @Article{Jansen1996c,
    Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Journal = {Annals of Operations Research},
    year = {1996},
    Pages = {197--231},
    Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, “Improved complexity using higher-order correctors for primal–dual dikin affine scaling,” Mathematical programming, vol. 76, iss. 1, p. 117–130, 1996. [Bibtex]
    @Article{Jansen1996a,
    Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
    Journal = {Mathematical Programming},
    year = {1996},
    Number = {1},
    Pages = {117--130},
    Volume = {76}
    }

1995

  • O. Güler, C. Roos, T. Terlaky, and J. Vial, “A survey of the implications of the behavior of the central path for the duality theory of linear programming,” Management science, vol. 41, p. 1922 – 1934, 1995. [Bibtex]
    @Article{Guler1995,
    Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
    Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Journal = {Management Science},
    year = {1995},
    Pages = {1922 -- 1934},
    Volume = {41}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, “A sufficient condition for self–concordance with application to some classes of structured convex programming problems,” Mathematical programming, vol. 69, p. 75 – 88, 1995. [Bibtex]
    @Article{Hertog1995a,
    Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
    Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
    Journal = {Mathematical Programming},
    year = {1995},
    Pages = {75 -- 88},
    Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, “A logarithmic barrier cutting plane method for convex programming,” Annals of operations research, vol. 58, p. 69 – 98, 1995. [Bibtex]
    @Article{Hertog1995,
    Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
    Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
    Journal = {Annals of Operations Research},
    year = {1995},
    Pages = {69 -- 98},
    Volume = {58}
    }
  • T. K. Ralphs, “Parallel Branch and Cut for Vehicle Routing,” PhD Thesis, 1995. [Bibtex]
    @PhDThesis{ Ral95,
    software  = {https://projects.coin-or.org/SYMPHONY},
    author  = {Ralphs, T.K.},
    month = {may},
    school  = {Cornell University},
    title = {{Parallel Branch and Cut for Vehicle Routing}},
    year = {1995},
    }

1994

  • K. M. Anstreicher and T. Terlaky, “A monotonic build-up simplex algorithm,” Operations research, vol. 42, p. 556 – 561, 1994. [Bibtex]
    @Article{Anstreicher1994,
    Title = {A Monotonic Build-Up Simplex Algorithm},
    Author = {Anstreicher, K.M. and Terlaky, T.},
    Journal = {Operations Research},
    year = {1994},
    Pages = {556 -- 561},
    Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, “An investigation of interior point algorithms for the linear transportation problems,” Siam journal on computing, vol. 17, iss. 5, p. 1202 – 1223, 1994. [Bibtex]
    @Article{Bastos1994,
    Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
    Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
    Journal = {SIAM Journal on Computing},
    year = {1994},
    Number = {5},
    Pages = {1202 -- 1223},
    Volume = {17}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “Inverse barrier methods for linear programming,” Revue rairo – operations research, vol. 28, p. 135 – 163, 1994. [Bibtex]
    @Article{Hertog1994,
    Title = {Inverse Barrier Methods for Linear Programming},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Revue RAIRO – Operations Research},
    year = {1994},
    Pages = {135 -- 163},
    Volume = {28}
    }
  • T. Illés, J. Mayer, and T. Terlaky, “Pseudoconvex optimization for a special problem of paint industry,” European journal of operational research, vol. 79, p. 537 – 548, 1994. [Bibtex]
    @Article{Illes1994,
    Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
    Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
    Journal = {European Journal of Operational Research},
    year = {1994},
    Pages = {537 -- 548},
    Volume = {79}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, “Primal–dual algorithms for linear programming based on the logarithmic barrier method,” Journal of optimization theory and applications, vol. 83, p. 1 – 26, 1994. [Bibtex]
    @Article{Jansen1994,
    Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
    Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {1994},
    Pages = {1 -- 26},
    Volume = {83}
    }

1993

  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, “A long step barrier method for convex quadratic programming,” Algorithmica, vol. 10, p. 365 – 382, 1993. [Bibtex]
    @Article{Anstreicher1993,
    Title = {A Long Step Barrier Method for Convex Quadratic Programming},
    Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
    Journal = {Algorithmica},
    year = {1993},
    Pages = {365 -- 382},
    Volume = {10}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, “Degeneracy in interior point methods,” Annales of operations research, vol. 46, p. 107 – 138, 1993. [Bibtex]
    @Article{Hertog1993a,
    Title = {Degeneracy in Interior Point Methods},
    Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
    Journal = {Annales of Operations Research},
    year = {1993},
    Pages = {107 -- 138},
    Volume = {46}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “The linear comlementarity problem, sufficient matrices and the criss–cross method,” Linear algebra and its applications, vol. 187, p. 1 – 14, 1993. [Bibtex]
    @Article{Hertog1993,
    Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Linear Algebra and Its Applications},
    year = {1993},
    Pages = {1 -- 14},
    Volume = {187}
    }
  • B. Jansen, C. Roos, and T. Terlaky, “The theory of linear programming: skew symmetric self–dual problems and the central path,” Optimization, vol. 29, p. 225 – 233, 1993. [Bibtex]
    @Article{Jansen1993,
    Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
    Author = {Jansen, B. and Roos, C. and Terlaky, T.},
    Journal = {Optimization},
    year = {1993},
    Pages = {225 -- 233},
    Volume = {29}
    }
  • T. Terlaky and S. Zhang, “Pivot rules for linear programming – a survey,” Annales of operations research, vol. 46, p. 203 – 233, 1993. [Bibtex]
    @Article{Terlaky1993,
    Title = {Pivot Rules for Linear Programming – A Survey},
    Author = {Terlaky, T. and Zhang, S.},
    Journal = {Annales of Operations Research},
    year = {1993},
    Pages = {203 -- 233},
    Volume = {46}
    }
  • [DOI] [Download PDF] T. K. Ralphs, “On the Mixed Chinese Postman Problem,” Operations research letters, vol. 14, p. 123–127, 1993. [Bibtex]
    @Article{ Ral93,
    author  = {Ralphs, T.K.},
    doi = {10.1016/0167-6377(93)90021-8},
    journal  = {Operations Research Letters},
    pages = {123--127},
    title = {{On the Mixed Chinese Postman Problem}},
    url = {http://coral.ie.lehigh.edu/~ted/files/papers/MPP.pdf},
    volume  = {14},
    year = {1993},
    }

1992

  • K. Fukuda and T. Terlaky, “Linear complementarity and oriented matroids,” Apanese journal of operations research, vol. 35, p. 45 – 61, 1992. [Bibtex]
    @Article{Fukuda1992,
    Title = {Linear Complementarity and Oriented Matroids},
    Author = {Fukuda, K. and Terlaky, T.},
    Journal = {apanese Journal of Operations Research},
    year = {1992},
    Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
    Pages = {45 -- 61},
    Volume = {35}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “A large–step analytic center method for a class of smooth convex programming problems,” Siam journal on optimization, vol. 2, iss. 1, p. 55 – 70, 1992. [Bibtex]
    @Article{Hertog1992,
    Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {SIAM Journal on Optimization},
    year = {1992},
    Number = {1},
    Pages = {55 -- 70},
    Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “On the classical logarithmic barrier function method for a class of smooth convex programming problems,” Journal of optimization theory and applications, vol. 73, iss. 1, p. 1 – 25, 1992. [Bibtex]
    @Article{Hertog1992a,
    Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Journal of Optimization Theory and Applications},
    year = {1992},
    Number = {1},
    Pages = {1 -- 25},
    Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “A build–up variant of the path–following method for lp,” Operations research letters, vol. 12, p. 181 – 186, 1992. [Bibtex]
    @Article{Hertog1992b,
    Title = {A Build–Up Variant of the Path–Following Method for LP},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Operations Research Letters},
    year = {1992},
    Pages = {181 -- 186},
    Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “On the monotonicity of the dual objective along barrier path,” Coal bulletin, vol. 20, p. 2 – 8, 1992. [Bibtex]
    @Article{Hertog1992c,
    Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {COAL Bulletin},
    year = {1992},
    Pages = {2 -- 8},
    Volume = {20}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, “A geometric programming approach to the channel capacity problem,” Engineering optimization, vol. 19, p. 115 – 130, 1992. [Bibtex]
    @Article{Klafszky1992a,
    Title = {A Geometric Programming Approach to the Channel Capacity Problem},
    Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
    Journal = {Engineering Optimization},
    year = {1992},
    Pages = {115 -- 130},
    Volume = {19}
    }
  • E. Klafszky and T. Terlaky, “Some generalizations of the criss–cross method for quadratic programming,” Mathemathische operationsforschung und statistics ser. optimization, vol. 24, p. 127 – 139, 1992. [Bibtex]
    @Article{Klafszky1992,
    Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
    year = {1992},
    Pages = {127 -- 139},
    Volume = {24}
    }
  • E. Klafszky and T. Terlaky, “On the ellipsoid method,” Radovi mathematicki, vol. 8, p. 269–280, 1992. [Bibtex]
    @Article{Klafszky1992b,
    Title = {On the Ellipsoid Method},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Radovi Mathematicki},
    year = {1992},
    Note = {This paper appeared in print in 1999},
    Pages = {269--280},
    Volume = {8}
    }

1991

  • D. den Hertog, C. Roos, and T. Terlaky, “A potential reduction variant of renegar’s short–step path–following method for linear programming,” Linear algebra and its applications, vol. 68, p. 43 – 68, 1991. [Bibtex]
    @Article{Hertog1991,
    Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Linear Algebra and Its Applications},
    year = {1991},
    Pages = {43 -- 68},
    Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, “A polynomial method of weighted centers for convex quadratic programming,” Journal of information and optimization sciences, vol. 12, p. 187 – 205, 1991. [Bibtex]
    @Article{Hertog1991a,
    Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
    Author = {den Hertog, D and Roos, C. and Terlaky, T.},
    Journal = {Journal of Information and Optimization Sciences},
    year = {1991},
    Pages = {187 -- 205},
    Volume = {12}
    }
  • E. Klafszky and T. Terlaky, “The role of pivoting in proving some fundamental theorems of linear algebra,” Linear algebra and its applications, vol. 151, p. 97 – 118, 1991. [Bibtex]
    @Article{Klafszky1991,
    Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Linear Algebra and Its Applications},
    year = {1991},
    Pages = {97 -- 118},
    Volume = {151}
    }

1990

  • E. Klafszky, J. Mayer, and T. Terlaky, “A new convergent algorithm for the continuous modular design problem,” The arabian journal for science and engineering, vol. 15, p. 687 – 694, 1990. [Bibtex]
    @Article{Klafszky1990,
    Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
    Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
    Journal = {The Arabian Journal for Science and Engineering},
    year = {1990},
    Pages = {687 -- 694},
    Volume = {15}
    }

1989

  • E. Klafszky, J. Mayer, and T. Terlaky, “Linearly constrained estimation by mathematical programming,” European journal of operational research, vol. 42, iss. 3, p. 254 – 267, 1989. [Bibtex]
    @Article{Klafszky1989b,
    Title = {Linearly Constrained Estimation by Mathematical Programming},
    Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
    Journal = {European Journal of Operational Research},
    year = {1989},
    Number = {3},
    Pages = {254 -- 267},
    Volume = {42}
    }
  • E. Klafszky and T. Terlaky, “Variants of the hungarian method for linear programming,” Mathemathische operationsforschung und statistics ser. optimization, vol. 20, iss. 1, p. 79 – 91, 1989. [Bibtex]
    @Article{Klafszky1989,
    Title = {Variants of the Hungarian Method for Linear Programming},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
    year = {1989},
    Number = {1},
    Pages = {79 -- 91},
    Volume = {20}
    }
  • E. Klafszky and T. Terlaky, “Some generalizations of the criss–cross method for the linear complementarity problem of oriented matroids,” Combinatorica, vol. 2, p. 189 – 198, 1989. [Bibtex]
    @Article{Klafszky1989a,
    Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Combinatorica},
    year = {1989},
    Pages = {189 -- 198},
    Volume = {2}
    }

1987

  • E. Klafszky and T. Terlaky, “Remarks on the feasibility problems of oriented matroids,” Annales universitatis scientiarum budapestinensis de rolando eötvös nominatae sectio computatorica, vol. VII, p. 155 – 157, 1987. [Bibtex]
    @Article{Klafszky1987,
    Title = {Remarks on the Feasibility Problems of Oriented Matroids},
    Author = {Klafszky, E. and Terlaky, T.},
    Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
    year = {1987},
    Pages = {155 -- 157},
    Volume = {VII}
    }
  • T. Terlaky, “A finite criss–cross method for oriented matroids,” Journal of combinatorial theory b, vol. 42, iss. 3, p. 319 – 327, 1987. [Bibtex]
    @Article{Terlaky1987,
    Title = {A Finite Criss–Cross Method for Oriented Matroids},
    Author = {Terlaky, T.},
    Journal = {Journal of Combinatorial Theory B},
    year = {1987},
    Number = {3},
    Pages = {319 -- 327},
    Volume = {42}
    }
  • T. Terlaky, “A new algorithm for quadratic programming,” European journal of operational research, vol. 32, iss. 2, p. 294 – 301, 1987. [Bibtex]
    @Article{Terlaky1987a,
    Title = {A New Algorithm for Quadratic Programming},
    Author = {Terlaky, T.},
    Journal = {European Journal of Operational Research},
    year = {1987},
    Number = {2},
    Pages = {294 -- 301},
    Volume = {32}
    }

1986

  • T. Terlaky, “Smoothing empirical functions by lp programming,” European journal of operational research, vol. 27, p. 343–363, 1986. [Bibtex]
    @Article{Terlaky1986,
    Title = {Smoothing Empirical Functions by lp Programming},
    Author = {Terlaky, Tamás},
    Journal = {European Journal of Operational Research},
    year = {1986},
    Pages = {343--363},
    Volume = {27}
    }

1985

  • T. Terlaky, “On lp programming,” European journal of operational research, vol. 22, p. 70–100, 1985. [Bibtex]
    @Article{Terlaky1985,
    Title = {On lp Programming},
    Author = {Terlaky, Tamás},
    Journal = {European Journal of Operational Research},
    year = {1985},
    Pages = {70--100},
    Volume = {22}
    }
  • T. Terlaky, “A convergent criss–cross method,” Mathemathische operationsforschung und statistics ser. optimization, vol. 16, iss. 5, p. 683 – 690, 1985. [Bibtex]
    @Article{Terlaky1985a,
    Title = {A Convergent Criss–Cross Method},
    Author = {Terlaky, T.},
    Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
    year = {1985},
    Number = {5},
    Pages = {683 -- 690},
    Volume = {16}
    }
  • .” [Bibtex]
    @article{BelottiKN2010,
    %author = {P. Belotti and K. Kompella and L. Noronha},
    %title = {A comparison of OTN and MPLS networks under traffic uncertainty},
    %url = {{http://myweb.clemson.edu/{~}pbelott/papers/robust-opt-network-design.pdf}},
    %journal = {IEEE/ACM Trans. on Networking},
    %year = {submitted}
    %}
  • .” [Bibtex]
    @article{NanniciniB2011,
    % author = {Nannicini, G. and Belotti, P.},
    % affiliation = {Singapore University of Technology and Design, Singapore, Singapore},
    % title = {Rounding-based heuristics for nonconvex MINLPs},
    % journal = {Mathematical Programming Computation},
    % publisher = {Springer Berlin / Heidelberg},
    % issn = {1867-2949},
    % keyword = {Mathematics},
    % pages = {1-31},
    % url = {http://dx.doi.org/10.1007/s12532-011-0032-x},
    % note = {10.1007/s12532-011-0032-x},
    % year = {in print}
    %}
  • .” [Bibtex]
    @article{LatifogluSB2011,
    %title = {Models for Production Planning under Power Interruptions},
    %author = {{\c{C}}. Latifoglu and L. V. Snyder and P. Belotti},
    %year = {submitted},
    %journal = {Naval Research Logistics},
    %url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1873728}
    %}
  • .” [Bibtex]
    @article{BelottiGPRT2011,
    %title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
    %author = {P. Belotti and J. C. G{\'o}ez and I. P{\'o}lik and T. K. Ralphs and T. Terlaky},
    %journal = {Linear Algebra and its Applications},
    %year = {submitted},
    %url = {http://www.lehigh.edu/ise/documents/11t_007.pdf}
    %}