E. Alper Yildirim

According to our database1, E. Alper Yildirim authored at least 28 papers between 2001 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem.
Transp. Sci., 2021

An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem.
Eur. J. Oper. Res., 2019

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

Analysis of copositive optimization based linear programming bounds on standard quadratic optimization.
J. Glob. Optim., 2015

Numerical Optimization of Eigenvalues of Hermitian Matrix Functions.
SIAM J. Matrix Anal. Appl., 2014

Rounding on the standard simplex: regular grids for global optimization.
J. Glob. Optim., 2014

Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks.
Comput. Oper. Res., 2013

On the accuracy of uniform polyhedral approximations of the copositive cone.
Optim. Methods Softw., 2012

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure.
Comput. Oper. Res., 2012

A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result.
INFORMS J. Comput., 2011

Fractional Particle Swarm Optimization in Multidimensional Search Space.
IEEE Trans. Syst. Man Cybern. Part B, 2010

A simpler characterization of a spectral lower bound on the clique number.
Math. Methods Oper. Res., 2010

Evolutionary artificial neural networks by multi-dimensional particle swarm optimization.
Neural Networks, 2009

An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem.
INFORMS J. Comput., 2009

Two Algorithms for the Minimum Enclosing Ball Problem.
SIAM J. Optim., 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

Unsupervised design of Artificial Neural Networks via multi-dimensional Particle Swarm Optimization.
Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
Discret. Appl. Math., 2007

On the Minimum Volume Covering Ellipsoid of Ellipsoids.
SIAM J. Optim., 2006

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function.
Comput. Optim. Appl., 2006

An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming.
Math. Oper. Res., 2003

Approximate minimum enclosing balls in high dimensions using core-sets.
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

Warm-Start Strategies in Interior-Point Methods for Linear Programming.
SIAM J. Optim., 2002

An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs.
SIAM J. Optim., 2002

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods.
Math. Program., 2001