default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDE. Alper Yildirim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j29]Yuzhou Qiu, E. Alper Yildirim
:
On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints. J. Glob. Optim. 90(2): 293-322 (2024)- [j28]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, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2022
- [j27]E. Alper Yildirim:
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs. J. Glob. Optim. 82(1): 1-20 (2022) - [j26]Y. Görkem Gökmen, E. Alper Yildirim:
On standard quadratic programs with exact and inexact doubly nonnegative relaxations. Math. Program. 193(1): 365-403 (2022) - 2021
- [j25]Jacek Gondzio, E. Alper Yildirim:
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. J. Glob. Optim. 81(2): 293-321 (2021) - [j24]Günes Erdogan, E. Alper Yildirim:
Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem. Transp. Sci. 55(1): 101-121 (2021) - 2019
- [j23]Ali Yesilçimen, E. Alper Yildirim:
An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem. Eur. J. Oper. Res. 276(2): 436-450 (2019) - 2017
- [j22]Kagan Gokbayrak, E. Alper Yildirim:
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. 81: 102-118 (2017) - [j21]E. Alper Yildirim:
Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis. Optim. Methods Softw. 32(6): 1163-1186 (2017) - 2015
- [j20]Gizem Sagol, E. Alper Yildirim:
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization. J. Glob. Optim. 63(1): 37-59 (2015) - 2014
- [j19]Immanuel M. Bomze, Stefan Gollowitzer, E. Alper Yildirim:
Rounding on the standard simplex: regular grids for global optimization. J. Glob. Optim. 59(2-3): 243-258 (2014) - [j18]Emre Mengi, E. Alper Yildirim, Mustafa Kiliç:
Numerical Optimization of Eigenvalues of Hermitian Matrix Functions. SIAM J. Matrix Anal. Appl. 35(2): 699-724 (2014) - 2013
- [j17]Kagan Gokbayrak, E. Alper Yildirim:
Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks. Comput. Oper. Res. 40(7): 1671-1679 (2013) - 2012
- [j16]Esra Koca, E. Alper Yildirim:
A hierarchical solution approach for a multicommodity distribution problem under a special cost structure. Comput. Oper. Res. 39(11): 2612-2624 (2012) - [j15]E. Alper Yildirim:
On the accuracy of uniform polyhedral approximations of the copositive cone. Optim. Methods Softw. 27(1): 155-173 (2012) - 2011
- [j14]Piyush Kumar, E. Alper Yildirim:
A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result. INFORMS J. Comput. 23(3): 377-391 (2011) - 2010
- [j13]E. Alper Yildirim:
A simpler characterization of a spectral lower bound on the clique number. Math. Methods Oper. Res. 71(2): 267-281 (2010) - 2009
- [j12]Piyush Kumar, E. Alper Yildirim:
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem. INFORMS J. Comput. 21(4): 614-629 (2009) - 2008
- [j11]Elizabeth John, E. Alper Yildirim:
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension. Comput. Optim. Appl. 41(2): 151-183 (2008) - [j10]E. Alper Yildirim:
Two Algorithms for the Minimum Enclosing Ball Problem. SIAM J. Optim. 19(3): 1368-1391 (2008) - [j9]Selin Damla Ahipasaoglu, E. Alper Yildirim:
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem. SIAM J. Optim. 19(3): 1392-1396 (2008) - 2007
- [j8]Michael J. Todd, E. Alper Yildirim:
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids. Discret. Appl. Math. 155(13): 1731-1744 (2007) - 2006
- [j7]E. Alper Yildirim, Xiaofei Fan-Orzechowski:
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function. Comput. Optim. Appl. 33(2-3): 229-247 (2006) - [j6]E. Alper Yildirim:
On the Minimum Volume Covering Ellipsoid of Ellipsoids. SIAM J. Optim. 17(3): 621-641 (2006) - 2003
- [j5]Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8 (2003) - [j4]E. Alper Yildirim:
An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming. Math. Oper. Res. 28(4): 649-676 (2003) - 2002
- [j3]E. Alper Yildirim, Michael J. Todd:
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs. SIAM J. Optim. 12(3): 692-714 (2002) - [j2]E. Alper Yildirim, Stephen J. Wright:
Warm-Start Strategies in Interior-Point Methods for Linear Programming. SIAM J. Optim. 12(3): 782-810 (2002) - 2001
- [j1]E. Alper Yildirim, Michael J. Todd:
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. Math. Program. 90(2): 229-261 (2001)
Conference and Workshop Papers
- 2003
- [c1]Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. ALENEX 2003: 45-55
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
