Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. - E. Alper Yildirim; Michael J. Todd (Math. Program., 2001)

An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs. - E. Alper Yildirim; Michael J. Todd (SIAM J. Optim., 2002)

Warm-Start Strategies in Interior-Point Methods for Linear Programming. - E. Alper Yildirim; Stephen J. Wright 001 (SIAM J. Optim., 2002)

Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. - Piyush Kumar; Joseph S. B. Mitchell; E. Alper Yildirim (ALENEX, 2003)

Approximate minimum enclosing balls in high dimensions using core-sets. - Piyush Kumar; Joseph S. B. Mitchell; E. Alper Yildirim (ACM J. Exp. Algorithmics, 2003)

An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming. - E. Alper Yildirim (Math. Oper. Res., 2003)

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function. - E. Alper Yildirim; Xiaofei Fan-Orzechowski (Comput. Optim. Appl., 2006)

On the Minimum Volume Covering Ellipsoid of Ellipsoids. - E. Alper Yildirim (SIAM J. Optim., 2006)

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids. - Michael J. Todd; E. Alper Yildirim (Discret. Appl. Math., 2007)

Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension. - Elizabeth John; E. Alper Yildirim (Comput. Optim. Appl., 2008)

Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem. - Selin Damla Ahipasaoglu; E. Alper Yildirim (SIAM J. Optim., 2008)

Two Algorithms for the Minimum Enclosing Ball Problem. - E. Alper Yildirim (SIAM J. Optim., 2008)

An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem. - Piyush Kumar; E. Alper Yildirim (INFORMS J. Comput., 2009)

A simpler characterization of a spectral lower bound on the clique number. - E. Alper Yildirim (Math. Methods Oper. Res., 2010)

A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result. - Piyush Kumar; E. Alper Yildirim (INFORMS J. Comput., 2011)

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure. - Esra Koca; E. Alper Yildirim (Comput. Oper. Res., 2012)

On the accuracy of uniform polyhedral approximations of the copositive cone. - E. Alper Yildirim (Optim. Methods Softw., 2012)

Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks. - Kagan Gokbayrak; E. Alper Yildirim (Comput. Oper. Res., 2013)

Rounding on the standard simplex: regular grids for global optimization. - Immanuel M. Bomze; Stefan Gollowitzer; E. Alper Yildirim (J. Glob. Optim., 2014)

Numerical Optimization of Eigenvalues of Hermitian Matrix Functions. - Emre Mengi; E. Alper Yildirim; Mustafa Kiliç (SIAM J. Matrix Anal. Appl., 2014)

Analysis of copositive optimization based linear programming bounds on standard quadratic optimization. - Gizem Sagol; E. Alper Yildirim (J. Glob. Optim., 2015)

Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks. - Kagan Gokbayrak; E. Alper Yildirim (Comput. Oper. Res., 2017)

Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis. - E. Alper Yildirim (Optim. Methods Softw., 2017)

An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem. - Ali Yesilçimen; E. Alper Yildirim (Eur. J. Oper. Res., 2019)

Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. - Jacek Gondzio; E. Alper Yildirim (J. Glob. Optim., 2021)

Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem. - Günes Erdogan; E. Alper Yildirim (Transp. Sci., 2021)

An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs. - E. Alper Yildirim (J. Glob. Optim., 2022)

On standard quadratic programs with exact and inexact doubly nonnegative relaxations. - Y. Görkem Gökmen; E. Alper Yildirim (Math. Program., 2022)

Operational Research: methods and applications. - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints. - Yuzhou Qiu; E. Alper Yildirim (J. Glob. Optim., 2024)

Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations. - Yuzhou Qiu; E. Alper Yildirim (Math. Program., 2025)

On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints. - Immanuel M. Bomze; Bo Peng; Yuzhou Qiu; E. Alper Yildirim (J. Optim. Theory Appl., 2025)

Publisher Correction: On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints. - Immanuel M. Bomze; Bo Peng; Yuzhou Qiu; E. Alper Yildirim (J. Optim. Theory Appl., 2025)