E. Alper Yildirim
Orcid: 0000-0003-4141-3189
According to our database1,
E. Alper Yildirim
authored at least 30 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints.
J. Glob. Optim., October, 2024
2022
On standard quadratic programs with exact and inexact doubly nonnegative relaxations.
Math. Program., 2022
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs.
J. Glob. Optim., 2022
2021
Transp. Sci., 2021
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations.
J. Glob. Optim., 2021
2019
An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem.
Eur. J. Oper. Res., 2019
2017
Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis.
Optim. Methods Softw., 2017
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks.
Comput. Oper. Res., 2017
2015
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization.
J. Glob. Optim., 2015
2014
SIAM J. Matrix Anal. Appl., 2014
J. Glob. Optim., 2014
2013
Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks.
Comput. Oper. Res., 2013
2012
Optim. Methods Softw., 2012
A hierarchical solution approach for a multicommodity distribution problem under a special cost structure.
Comput. Oper. Res., 2012
2011
A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result.
INFORMS J. Comput., 2011
2010
Math. Methods Oper. Res., 2010
2009
INFORMS J. Comput., 2009
2008
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem.
SIAM J. Optim., 2008
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension.
Comput. Optim. Appl., 2008
2007
Discret. Appl. Math., 2007
2006
Comput. Optim. Appl., 2006
2003
Math. Oper. Res., 2003
ACM J. Exp. Algorithmics, 2003
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003
2002
SIAM J. Optim., 2002
SIAM J. Optim., 2002
2001
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods.
Math. Program., 2001