default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarid Alizadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]Marta Cavaleiro
, Farid Alizadeh:
A branch-and-bound method for the minimum k-enclosing ball problem. Oper. Res. Lett. 50(3): 274-280 (2022)- 2021
- [j17]Marta Cavaleiro, Farid Alizadeh:
A dual simplex-type algorithm for the smallest enclosing ball of balls. Comput. Optim. Appl. 79(3): 767-787 (2021)
2010 – 2019
- 2019
- [j16]Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti:
Preface. Discret. Appl. Math. 256: 1-4 (2019) - 2018
- [j15]Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti:
Preface: Special issue dedicated to Distance Geometry. J. Glob. Optim. 72(1): 1-4 (2018) - 2017
- [i1]Marta Cavaleiro, Farid Alizadeh:
A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem. CoRR abs/1707.03387 (2017) - 2013
- [j14]Farid Alizadeh, Dávid Papp:
Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming. Ann. Oper. Res. 208(1): 291-308 (2013) - [j13]Dávid Papp, Farid Alizadeh:
Semidefinite Characterization of Sum-of-Squares Cones in Algebras. SIAM J. Optim. 23(3): 1398-1423 (2013) - 2011
- [j12]Farid Alizadeh, Yu Xia:
The Q Method for Symmetric Cone Programming. J. Optim. Theory Appl. 149(1): 102-137 (2011) - [j11]Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh:
Bilinear optimality constraints for the cone of positive polynomials. Math. Program. 129(1): 5-31 (2011) - [c5]Dávid Papp, Farid Alizadeh:
Multivariate arrival rate estimation using semidefinite programming. WSC 2011: 2777-2787
2000 – 2009
- 2008
- [j10]Yu Xia, Farid Alizadeh:
The Q method for second order cone programming. Comput. Oper. Res. 35(5): 1510-1538 (2008) - [j9]Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, Gábor Rudolf:
Arrival Rate Approximation by Nonnegative Cubic Splines. Oper. Res. 56(1): 140-156 (2008) - 2003
- [j8]Farid Alizadeh, Donald Goldfarb:
Second-order cone programming. Math. Program. 95(1): 3-51 (2003) - [j7]S. H. Schmieta, Farid Alizadeh:
Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96(3): 409-438 (2003) - 2001
- [j6]S. H. Schmieta, Farid Alizadeh:
Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones. Math. Oper. Res. 26(3): 543-564 (2001)
1990 – 1999
- 1998
- [j5]Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results. SIAM J. Optim. 8(3): 746-768 (1998) - 1997
- [j4]Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77: 111-128 (1997) - 1995
- [j3]Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica 13(1/2): 52-76 (1995) - [j2]Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig:
Physical Mapping of Chromosomes Using Unique Probes. J. Comput. Biol. 2(2): 159-184 (1995) - [j1]Farid Alizadeh:
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM J. Optim. 5(1): 13-51 (1995) - 1994
- [c4]Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig:
Physical Mapping of Chromosomes Using Unique Probes. SODA 1994: 489-500 - 1993
- [c3]Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA 1993: 371-381 - 1992
- [c2]Farid Alizadeh:
Combinatorial Optimization with Semi-Definite Matrices. IPCO 1992: 385-405 - 1991
- [c1]Farid Alizadeh:
A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs. SODA 1991: 188-194
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-05-08 21:01 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:
